Summary of Estimating the Number Of Reachable Positions in Minishogi, by Sotaro Ishii et al.
Estimating the number of reachable positions in Minishogi
by Sotaro Ishii, Tetsuro Tanaka
First submitted to arxiv on: 29 Aug 2024
Categories
- Main: Artificial Intelligence (cs.AI)
- Secondary: Computer Science and Game Theory (cs.GT)
GrooveSquid.com Paper Summaries
GrooveSquid.com’s goal is to make artificial intelligence research accessible by summarizing AI papers in simpler terms. Each summary below covers the same AI paper, written at different levels of difficulty. The medium difficulty and low difficulty versions are original summaries written by GrooveSquid.com, while the high difficulty version is the paper’s original abstract. Feel free to learn from the version that suits you best!
| Summary difficulty | Written by | Summary |
|---|---|---|
| High | Paper authors | High Difficulty Summary Read the original abstract here |
| Medium | GrooveSquid.com (original content) | Medium Difficulty Summary The paper explores the feasibility of solving Minishogi, a complex variant of Japanese chess-like game Gogo Shogi. A key challenge lies in determining the number of reachable positions from the initial state, as checking position legality is difficult. The authors employ uniform random sampling and legal move evaluation to estimate this value. Their experimental results indicate that there are approximately 2.38 x 10^18 reachable Minishogi positions. |
| Low | GrooveSquid.com (original content) | Low Difficulty Summary This paper tries to figure out how many different ways a game of Minishogi can be played, starting from the very beginning. It’s hard to check if each move is allowed in this game. The researchers used a random sampling method and checked which moves are legal to estimate this number. They found that there are approximately 2.38 trillion possible games. |
