• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Solving breakthrough with Race Patterns and Job-Level Proof Number Search

Cazenave, Tristan; Jouandeau, Nicolas; Saffidine, Abdallah (2012), Solving breakthrough with Race Patterns and Job-Level Proof Number Search, in Van den Herik, H. Jaap, Advances in Computer Games 13th International Conference, ACG 2011, Tilburg, The Netherlands, November 20-22, 2011, Revised Selected Papers, Springer : Berlin Heidelberg, p. 356

View/Open
solving.pdf (279.4Kb)
Type
Communication / Conférence
Date
2012
Conference title
13th International Conference on Advances in Computer Games, ACG 2011
Conference date
2011-11
Conference city
Tilburg
Conference country
Netherlands
Book title
Advances in Computer Games 13th International Conference, ACG 2011, Tilburg, The Netherlands, November 20-22, 2011, Revised Selected Papers
Book author
Van den Herik, H. Jaap
Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-642-31865-8
Pages
356
Metadata
Show full item record
Author(s)
Cazenave, Tristan
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Jouandeau, Nicolas cc
Laboratoire d'Informatique Avancée de Saint-Denis [LIASD]
Saffidine, Abdallah
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
breakthrough is a recent race-based board game usually played on a 8×8 board. We describe a method to solve 6×5 boards based on (1) race patterns and (2) an extension of (JLPNS).Using race patterns is a new domain-specific technique that allows early endgame detection. The patterns we use enable us to prune positions safely and statically as far as 7 moves from the end.For the purpose of solving Breakthrough we also present an extension of the parallel algorithm (JLPNS), viz. when a PN search is used as the underlying job. In this extension, partial results are regularly sent by the clients to the server.
Subjects / Keywords
Breakthrough; Board game

Related items

Showing items related by title and author.

  • Thumbnail
    Generalized Proof Number Search 
    Cazenave, Tristan; Saffidine, Abdallah (2011) Communication / Conférence
  • Thumbnail
    Multiple-outcome proof number search 
    Saffidine, Abdallah; Cazenave, Tristan (2012) Communication / Conférence
  • Thumbnail
    Material Symmetry to Partition Endgame Tables 
    Buron, Cédric; Cazenave, Tristan; Jouandeau, Nicolas; Saffidine, Abdallah (2014) Communication / Conférence
  • Thumbnail
    Nested Monte Carlo Search for Two-Player Games 
    Cazenave, Tristan; Saffidine, Abdallah; Schofield, Michael John; Thielscher, Michael (2016) Communication / Conférence
  • Thumbnail
    Score Bounded Monte-Carlo Tree Search 
    Saffidine, Abdallah; Cazenave, Tristan (2011) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo