Multiple Hook Removing Game Whose Starting Position is a Rectangular Young Diagram with the Unimodal Numbering
Tomoaki Abuku, Masato Tada

TL;DR
This paper introduces the Multiple Hook Removing Game (MHRG), analyzes its positions' $\
Contribution
It defines MHRG with a rectangular Young diagram and determines its $\
Findings
Calculated $\
Proved isomorphism between MHRG$(m,n)$ and MHRG$(m,n+1)$ under certain conditions
Established relationships between MHRG and the Hook Removing Game (HRG) in terms of shifted Young diagrams
Abstract
We introduce a new impartial game, named Multiple Hook Removing Game (MHRG for short). We also determine the -values of some game positions (including the starting positions) in MHRG, the MHRG whose starting position is the rectangular Young diagram of size with the unimodal numbering. In addition, we prove that MHRG is isomorphic, as games, to MHRG (if and is even), and give a relationship between MHRG (and MHRG) and HRG, the Hook Removing Game in terms of shifted Young diagrams.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · History and Theory of Mathematics · Artificial Intelligence in Games
