The following pages link to Checkers Is Solved (Q3101696):
Displaying 24 items.
- General game playing with stochastic CSP (Q265712) (← links)
- Effect of look-ahead depth in evolutionary checkers (Q389031) (← links)
- Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information (Q464622) (← links)
- On the number of positions in chess without promotion (Q495765) (← links)
- When is it better not to look ahead? (Q622121) (← links)
- Playing the perfect Kriegspiel endgame (Q708207) (← links)
- Game theory: a user's guide (from my own point of view, of course) (Q2304829) (← links)
- Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction (Q2342646) (← links)
- A Probabilistic Analysis of the Game of the Goose (Q2808273) (← links)
- Scalable Parallel DFPN Search (Q2947916) (← links)
- Material Symmetry to Partition Endgame Tables (Q2947925) (← links)
- Is a Good Offensive Always the Best Defense? (Q2979993) (← links)
- A New Proof-Number Calculation Technique for Proof-Number Search (Q3601829) (← links)
- About the Completeness of Depth-First Proof-Number Search (Q3601830) (← links)
- Weak Proof-Number Search (Q3601832) (← links)
- Remarks on History and Presence of Game Tree Search and Research (Q4915265) (← links)
- Intransitively winning chess players positions (Q5052112) (← links)
- Superintelligence Cannot be Contained: Lessons from Computability Theory (Q5145835) (← links)
- Proof-Number Search and Its Variants (Q5302475) (← links)
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH (Q5506116) (← links)
- BEST PLAY IN FANORONA LEADS TO DRAW (Q5506119) (← links)
- Optimal retrieval in puzzle‐based storage with heuristic search and tabulation (Q6065896) (← links)
- Counting Star-Battle configurations (Q6106407) (← links)
- Double moves by each player in chess openings make the game fairer (Q6494747) (← links)
