Retrograde analysis of patterns versus metaprogramming

作者: T. Cazenave

DOI: 10.1007/978-3-7908-1833-8_3

关键词: Domain theoryMetaprogrammingPartial deductionTheoretical computer scienceSimple (abstract algebra)Computer science

摘要: The main objective of this chapter is to present a comparative study two techniques that automatically generate useful knowledge in games. Retrograde analysis patterns generates pattern databases, starting with simple definition sub-goal game and progressively finding all the given sizes fulfill sub-goal. Metaprogramming based on similar concepts, but instead generating fixed size patterns, it programs. Programs enable represent more flexible way. However, they may take time use than knowledge. We will describe application these methods Hex, compare their behaviors game.

参考文章(11)
Yngvi Björnsson, Tony Marsland, From minimax to Manhattan national conference on artificial intelligence. pp. 31- 36 ,(1997)
Tristan Cazenave, Metaprogramming Forced Moves. european conference on artificial intelligence. pp. 645- 649 ,(1998)
Jack van Rijswijck, Are Bees Better than Fruitflies Lecture Notes in Computer Science. pp. 13- 25 ,(2000) , 10.1007/3-540-45486-1_2
David Gale, The Game of Hex and the Brouwer Fixed-Point Theorem American Mathematical Monthly. ,vol. 86, pp. 818- 827 ,(1979) , 10.1080/00029890.1979.11994922
Vadim V. Anshelevich, The Game of Hex: An Automatic Theorem Proving Approach to Game Programming national conference on artificial intelligence. pp. 189- 194 ,(2000)
J. Pitrat, Games: The Next Challenge Icca Journal. ,vol. 21, pp. 147- 156 ,(1998) , 10.3233/ICG-1998-21302
Richard E. Korf, Finding optimal solutions to Rubik's cube using pattern databases national conference on artificial intelligence. pp. 700- 705 ,(1997)
Ken Thompson, None, 6-Piece Endgames ICGA Journal. ,vol. 19, pp. 215- 226 ,(1996) , 10.3233/ICG-1996-19403