作者: T. Cazenave
DOI: 10.1007/978-3-7908-1833-8_3
关键词: Domain theory 、 Metaprogramming 、 Partial deduction 、 Theoretical computer science 、 Simple (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.