Burnt Pancake Problem: New Lower Bounds on the Diameter and New Experimental Optimality Ratios

Autor: Bruno Bouzy

Publikováno v: Proceedings of the International Symposium on Combinatorial Search. 7:119-120

For the burnt pancake problem, we provide new values of g(-IN), new hard positions and new experimental optimality ratios.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::51e474c29294c95dda16b95f30aec550
https://doi.org/10.1609/socs.v7i1.18398

Artificial Intelligence for Games

Autor: Bruno Bouzy, Vincent Corruble, Tristan Cazenave, Olivier Teytaud

Publikováno v: A Guided Tour of Artificial Intelligence Research : Volume II: AI Algorithms
A Guided Tour of Artificial Intelligence Research : Volume II: AI Algorithms, Springer, pp.313-337, 2020, ⟨10.1007/978-3-030-06167-8_11⟩
A Guided Tour of Artificial Intelligence Research ISBN: 9783030061661

International audience; This chapter presents the classical alpha-beta algorithm and several variants, Monte Carlo Tree Search which is at the origin of recent progresses in many games, techniques used in video games and puzzles, and retrograde analy

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49597284c87625eeaaed71c83981b15b
https://hal.archives-ouvertes.fr/hal-03118174/file/games.pdf

Playing Hanabi Near-Optimally

Autor: Bruno Bouzy

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319716480
ACG

This paper describes a study on the game of Hanabi, a multi-player cooperative card game in which a player sees the cards of the other players but not his own cards. Previous work using the hat principle reached near-optimal results for 5 players and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::f94e35f82c734233bbf1bbb849693f09
https://doi.org/10.1007/978-3-319-71649-7_5

Playing Amazons Endgames1

Autor: Bruno Bouzy, Hiroyuki Iida, Julien Kloetzer

Publikováno v: ICGA Journal. 32:140-148

The game of the Amazons is a fairly young member of the class of territory-games. Since there is very few human play, it is difficult to estimate the level of current programs. However, it is believed that humans could play much stronger than todays

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::cdf9c388ab008acd1461f115fa8cd1f6
https://doi.org/10.3233/icg-2009-32303

HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO

Autor: Bruno Bouzy

Publikováno v: New Mathematics and Natural Computation. :139-146

Recently, the Monte Carlo approach has been applied to computer go with promising success. INDIGO uses such an approach which can be enhanced with specific heuristics. This paper assesses two heuristics within the 19 × 19 Monte Carlo go framework of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60a4cd0ccdf6ee22610c86ce84761dc5
https://doi.org/10.1142/s1793005706000427