Board Maps and Hill-Climbing for Opening and Middle Game Play in Shogi
Abstract
Most strong game-playing programs use large, well tuned opening books to guide them through the early stages of the game. However, in shogi (Japanese chess) the classic approach of building a large opening book of known positions is infeasible. In this paper, we present a different approach for opening and middle game play in shogi. This method uses board maps that assign values to each square for each piece in a number of different formations. Hill-climbing is then used to guide pieces to optimal squares. We define board maps for defensive piece formations (castles), attacking formations (assaults) and for recognizing the type of opening position. Results show that using board maps in combination with hill-climbing significantly improves the playing strength of a shogi program. Furthermore, using maps for both castles and assaults is better than using only maps for castles.
Keywords
Playing Strength Opening Book Gold Silver Individual Piece Opening PlayPreview
Unable to display preview. Download preview PDF.
References
- 1.Baird, H., Thompson, K.: Reading chess. IEEE Transactions on Pattern Analysis and Machine Intelligence 12, 552–559 (1990)CrossRefGoogle Scholar
- 2.Schaeffer, J.: One Jump Ahead: Challenging Human Supremacy in Checkers. Springer, Heidelberg (1997)Google Scholar
- 3.Buro, M.: The Othello match of the year: Takeshi Murakami vs. Logistello. International Computer Chess Association Journal 20, 189–193 (1997)Google Scholar
- 4.Campbell, M., Hoane Jr., A., Hsu, F.: Deep Blue. Artificial Intelligence 134, 57–83 (2002)MATHCrossRefGoogle Scholar
- 5.Schaeffer, J., Plaat, A.: Kasparov versus Deep Blue: The rematch. International Computer Chess Association Journal 20, 95–101 (1997)Google Scholar
- 6.Takizawa, T., Grimbergen, R.: Review: Computer shogi through 2000. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 433–442. Springer, Heidelberg (2002)CrossRefGoogle Scholar
- 7.Grimbergen, R.: A survey of tsume-shogi programs using variable-depth search. In: van den Herik, H.J., Iida, H. (eds.) CG 1998. LNCS, vol. 1558, pp. 300–317. Springer, Heidelberg (1999)CrossRefGoogle Scholar
- 8.Yamashita, H.: Yss, http://plaza15.mbn.or.jp/~yss/index_j.html (2003) (in Japanese)
- 9.Matsubara, H., Iida, H., Grimbergen, R.: Natural developments in game research: from chess to shogi to Go. International Computer Chess Association Journal 19, 103–112 (1996)Google Scholar
- 10.Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison Wesley Publishing Company, Reading (1984)Google Scholar
- 11.Beal, D.: A generalised quiescence search algorithm. Artificial Intelligence 43, 85–98 (1990)CrossRefGoogle Scholar
- 12.Schaeffer, J.: The history heuristic and alpha-beta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence 11, 1203–1212 (1989)CrossRefGoogle Scholar
- 13.Beal, D.: Experiments with the null move. In: Beal, D. (ed.) Advances in Computer Chess 5, pp. 65–79. Elsevier Science Publishers B.V., Amsterdam (1989)Google Scholar
- 14.Seo, M.: On effective utilization of dominance relations in tsume-shogi solving algorithms. In: Game Programming Workshop in Japan 1999, pp. 129–136 (1999) (in Japanese)Google Scholar
- 15.Seo, M.: The C* algorithm for AND/OR tree search and its application to a tsumeshogi program. Master’s thesis, University of Tokyo, Faculty of Science (1995)Google Scholar
- 16.Yamashita, H.: Yss: About its datastructures and algorithm. In: Matsubara, H. (ed.) Computer Shogi Progress 2, Kyoritsu Suppan Co., pp. 112–142 (1998) (in Japanese)Google Scholar
- 17.Kotani, Y.: Example-based piece formation by partial matching in shogi. In: van den Herik, J., Monien, B. (eds.) Advances in Computer Games 9, Universiteit Maastricht, Department of Computer Science, pp. 223–232 (2001)Google Scholar