Abstract
We present the design of a computer program for playing Progressive Chess. In this game, players play progressively longer series of moves rather than just making one move per turn. Our program follows the generally recommended strategy for this game, which consists of three phases: looking for possibilities to checkmate the opponent, playing generally good moves when no checkmate can be found, and preventing checkmates from the opponent. In this paper, we focus on efficiently searching for checkmates, putting to test various heuristics for guiding the search. We also present the findings of self-play experiments between different versions of the program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The solution to Fig. 1: Bb4-d6, b6-b5, b5-b4, b4-b3, b3xa2, a2xb1N, Nb1-c3, Bd6-f4.
- 2.
For brevity, we use ‘he’ and ‘his’, whenever ‘he or she’ and ‘his or her’ are meant.
References
Pritchard, D.: Popular Chess Variants. BT Batsford Limited, UK (2000)
Pritchard, D.B., Beasley, J.D.: The classified encyclopedia of chess variants. J. Beasley (2007)
Leoncini, M., Magari, R.: Manuale di Scacchi Eterodossi, Siena-Italy (1980)
Dipilato, G., Leoncini, M.: Fondamenti di Scacchi Progressivi, Macerata-Italy (1987)
Castelli, A.: Scacchi Progressivi. Matti Eccellenti (Progressive Chess. Excellent Checkmates), Macerata-Italy (1996)
Castelli, A.: Scacchi progressivi. Finali di partita (Progressive Chess. Endgames), Macerata-Italy (1997)
Beasley, J.: Progressive chess: how often does the “italian rule” make a difference? (2011). http://www.jsbeasley.co.uk/vchess/italian_rule.pdf. Accessed 06 March 2015
Chinchalkar, S.: An upper bound for the number of reachable positions. ICCA J. 19(3), 181–183 (1996)
Wu, D.J.: Move ranking and evaluation in the game of Arimaa. Master’s thesis, Harvard University, Cambridge, USA (2011)
Kozelek, T.: Methods of MCTS and the game Arimaa. Master’s thesis, Charles University, Prague, Czech Republic (2010)
Lewis, A.: Game over, Arimaa? ICGA J. 38(1), 55–62 (2015)
Wu, D.: Designing a winning Arimaa program. ICGA J. 38(1), 19–40 (2015)
Janko, V., Guid, M. http://www.ailab.si/progressive-chess/
Junghanns, A., Schaeffer, J.: Search versus knowledge in game-playing programs revisited. In: Proceedings of 15th International Joint Conference on Artificial Intelligence, vol. 1, pp. 692–697. Morgan Kaufmann (1999)
Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: 5th International Conference on Computers and Games, CG 2006, Turin, Italy, 29–31 May 2006, Revised Papers, pp. 72–83 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Janko, V., Guid, M. (2015). Development of a Program for Playing Progressive Chess. In: Plaat, A., van den Herik, J., Kosters, W. (eds) Advances in Computer Games. ACG 2015. Lecture Notes in Computer Science(), vol 9525. Springer, Cham. https://doi.org/10.1007/978-3-319-27992-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-27992-3_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27991-6
Online ISBN: 978-3-319-27992-3
eBook Packages: Computer ScienceComputer Science (R0)