Optimistic Heuristics for MineSweeper - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Optimistic Heuristics for MineSweeper


We present a combination of Upper Con dence Tree (UCT) and domain speci c solvers, aimed at improving the behavior of UCT for long term aspects of a problem. Results improve the state of the art, combining top performance on small boards (where UCT is the state of the art) and on big boards (where variants of CSP rule).
Fichier principal
Vignette du fichier
mines3.pdf (216.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00750577 , version 1 (11-11-2012)
hal-00750577 , version 2 (19-02-2013)



Olivier Buffet, Chang-Shing Lee, Woanting Lin, Olivier Teytaud. Optimistic Heuristics for MineSweeper. ICS - International Computer Symposium - 2012, Dec 2012, Hualien, Taiwan. pp.199-207, ⟨10.1007/978-3-642-35452-6_22⟩. ⟨hal-00750577v2⟩
720 View
1579 Download



Gmail Facebook Twitter LinkedIn More