SOLVING KRIEGSPIEL-LIKE PROBLEMS: EXPLOITING A TRANSPOSITION TABLE
作者： Makoto Sakuta , Hiroyuki Iida
关键词:
摘要:
core.ac.uk
sci-hub.st 参考文章(10)
A. Nagai, A New Depth-First-Search Algorithm for AND/OR Trees ICGA Journal. ,vol. 22, pp. 35- 36 ,(1999) , 10.3233/ICG-1999-22106
Albert L. Zobrist, A New Hashing Method with Application for Game Playing ICGA Journal. ,vol. 13, pp. 69- 73 ,(1990) , 10.3233/ICG-1990-13203
D.M. Breuker, Memory versus search in games Universiteit Maastricht. ,(1998)
Alfred J Menezes, Paul C van Oorschot, Scott A Vanstone, Handbook of Applied Cryptography ,(1996)
P. Deutsch, GZIP file format specification version 4.3 RFC. ,vol. 1952, pp. 1- 12 ,(1996)
Thomas S. Ferguson, Mate with bishop and knight in kriegspiel Theoretical Computer Science. ,vol. 96, pp. 389- 403 ,(1992) , 10.1016/0304-3975(92)90344-F
P Ciancarini, F. Maran, Francesco Dalla Libera, Decision Making under Uncertainty: a rational approach to Kriegspiel Advances in Computer Chess Conference. ,(1996)
Saul A. Teukolsky, Brian P. Flannery, William T. Vetterling, William H. Press, Numerical recipes in C Cambridge University Press. ,(1994)
Ayumu Nagai, Hiroshi Imai, Application of df-pn+to Othello Endgames Proceedings of Game Programming Workshop '99. ,vol. 1999, pp. 16- 23 ,(1999)
David Pritchard, The encyclopedia of chess variants ,(2001)