Metaprogramming Forced Moves - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1998

Metaprogramming Forced Moves

Résumé

Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branching factor. Knowing forced moves drastically cuts the search trees. We propose a language and a metaprogram to create automatically the knowledge about interesting and forced moves, only given the rules about the direct effects of the moves. We describe the successful application of this metaprogram to the game of Go. It creates rules that give complete sets of forced moves.
Fichier non déposé

Dates et versions

hal-01617585 , version 1 (16-10-2017)

Identifiants

  • HAL Id : hal-01617585 , version 1

Citer

Tristan Cazenave. Metaprogramming Forced Moves. ECAI 1998 - 13th European Conference on Artificial Intelligence, Aug 1998, Brighton, United Kingdom. pp.645-649. ⟨hal-01617585⟩
22 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More