Conference Papers Year : 2012

Optimistic Heuristics for MineSweeper

Abstract

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).

Domains

Optimization and Control [math.OC]
Fichier principal
Vignette du fichier
mines3.pdf (216.8 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Olivier Teytaud  : Connect in order to contact the contributor

https://inria.hal.science/hal-00750577

Submitted on : Tuesday, February 19, 2013-5:00:33 PM

Last modification on : Thursday, April 18, 2024-2:50:09 PM

Long-term archiving on : Monday, May 20, 2013-4:04:51 AM

Download

Dates and versions

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

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

EC-PARIS UNIV-RENNES1 CNRS INRIA IRISA UMR8623 UNIV-LORRAINE INRIA2 LRI-AO TDS-MACS LORIA LORIA-AIS UR1-MATH-STIC UNIV-PARIS-SACLAY UR1-UFR-ISTIC UNIV-RENNES UR1-MATH-NUM
761 View
1791 Download

Altmetric

Share

More