Dual Lambda Search and Shogi Endgames
We propose a new threat-base search algorithm which takes into account threats by both players. In full-board Semeais in Go or Shogi endgames, making naive attack moves often result in losing the game. The reason is that a player must first make a defense move if the opponent has a better attack move than his own. Some attack moves weaken the defense of the player who made the move. Thus, players must be aware of the threats by both players to avoid such naive attack moves. However, existing threat-based search algorithms are only aware of threats by one player, and cannot detect such naive attacks efficiently. We propose a solution to this problem, by applying λ-search mutually recursively so that it searches the best move by taking into account threats by both players. We call this search algorithm dual λ -search. Dual λ-search can handle inversions efficiently compared to previous algorithms by making passes for both players. We implemented dual λ-search with Df-pn as the driver, and made experiments with difficult Shogi-endgame problems. We showed the effectiveness of our algorithm by solving 32 problems out of 97. It includes solving problems that even one of the strongest Shogi program had not yet been able to solve correctly.
KeywordsSearch Algorithm Search Tree Attack Move Game Tree Proof Tree
Unable to display preview. Download preview PDF.
- 1.Arioka, M.: Search in Shogi program KFEnd. In: Advances in Computer Shogi 4, Kyoritsu, pp. 18–40 (2003)Google Scholar
- 3.Cazenave, T.: Iterative Widening. In: IJCAI 2001 Proceedings, vol. 1, pp. 523–528 (2001)Google Scholar
- 5.Grimbergen, R., Muraoka, T.: What Shogi Programs Still Cannot Do - a New Test Set For Shogi. In: The 9th Game Programming Workshop in Japan, pp. 40–47 (2004)Google Scholar
- 6.Iida, H., Abe, F.: Brinkmate Search. In: Game Programming Workshop in Japan 1996, Kanagawa, Japan, pp. 160–169 (1996)Google Scholar
- 8.Kawano, Y.: Using Similar Positions to Search Game Trees. In: Games of No Chance, pp. 193–202. Cambridge University Press, Cambridge (1996)Google Scholar
- 9.Kishimoto, A., Müller, M.: DF-PN in Go: An Application to the One-Eye Problem. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) 10th Advances in Computer Games (ACG10), Many Games, Many Challenges, pp. 125–141. Kluwer Academic Publishers, Boston (2004)Google Scholar
- 12.Tanase, Y.: Algorithm of IS Shogi, Kyouristu, pp. 1–14 (2000) (in Japanese)Google Scholar
- 13.Thompson, K.: Retrograde Analysis of Certain Endgames. ICCA Journal 9(3), 131–139 (1986)Google Scholar
- 15.Yamashita, H.: YSS - Data Structure and Algorithm. In: Advances in Computer Shogi 2, Kyoritsu, pp. 112–142 (1998) (in Japanese) Google Scholar