Checkers Is Solved
From MaRDI portal
Publication:3101696
DOI10.1126/science.1144079zbMath1226.00005OpenAlexW1995987707WikidataQ28237175 ScholiaQ28237175MaRDI QIDQ3101696
No author found.
Publication date: 30 November 2011
Published in: Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1126/science.1144079
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46) Popularization of mathematics (00A09)
Related Items (23)
General game playing with stochastic CSP ⋮ Proof-Number Search and Its Variants ⋮ Effect of look-ahead depth in evolutionary checkers ⋮ Scalable Parallel DFPN Search ⋮ Material Symmetry to Partition Endgame Tables ⋮ Optimal retrieval in puzzle‐based storage with heuristic search and tabulation ⋮ When is it better not to look ahead? ⋮ Counting Star-Battle configurations ⋮ Is a Good Offensive Always the Best Defense? ⋮ Intransitively winning chess players positions ⋮ Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information ⋮ Superintelligence Cannot be Contained: Lessons from Computability Theory ⋮ On the number of positions in chess without promotion ⋮ Remarks on History and Presence of Game Tree Search and Research ⋮ Playing the perfect Kriegspiel endgame ⋮ A New Proof-Number Calculation Technique for Proof-Number Search ⋮ About the Completeness of Depth-First Proof-Number Search ⋮ Weak Proof-Number Search ⋮ A Probabilistic Analysis of the Game of the Goose ⋮ Game theory: a user's guide (from my own point of view, of course) ⋮ PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH ⋮ BEST PLAY IN FANORONA LEADS TO DRAW ⋮ Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction
This page was built for publication: Checkers Is Solved
