Strategic Search : A new Paradigm for Complex Game Playing. Application to the Game of Go

Régis Moneret 1
1 APA - Apprentissage et Acquisition des connaissances
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this article, we describe a new search technique that we call "Strategic Search": Instead of developing a game tree by considering every legal moves in a given position, we consider only the goals that can be achieved from that position. As achieving a goal can take tens to hundreds moves in complex games like Go, this means that the search will run much deeper, than with usual search techniques. Of course, to do this, one has to be able to predict and assess the future position once the goal will be achieved. This is done by applying modeling rules that are at the time being, hand-coded in the system, but should be learned in the future by a machine learning module
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01573974
Contributor : Lip6 Publications <>
Submitted on : Friday, August 11, 2017 - 11:33:51 AM
Last modification on : Thursday, March 21, 2019 - 1:01:01 PM

Identifiers

  • HAL Id : hal-01573974, version 1

Citation

Régis Moneret. Strategic Search : A new Paradigm for Complex Game Playing. Application to the Game of Go. AAAI Spring Symposium, Mar 1999, Palo Alto, CA, United States. pp.95-100. ⟨hal-01573974⟩

Share

Metrics

Record views

17