Backgammon is hard

DOI10.1007/978-3-030-92681-6_38OpenAlexW4205996707MaRDI QIDQ2150573

R. Teal Witter

Publication date: 29 June 2022

Full work available at URL: https://arxiv.org/abs/2106.16172

zbMATH Keywords

computational complexitygames

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hanabi is NP-hard, even for cheaters who look at their cards
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• On the complexity of some two-person perfect-information games
• Co-evolution in the successful learning of backgommon strategy
• Mario Kart Is Hard
• N by N Checkers is Exptime Complete
• Provably Difficult Combinatorial Games
• Optimal Doubling in Backgammon
• Reducibility among Combinatorial Problems
• Programming backgammon using self-teaching neural nets

This page was built for publication: Backgammon is hard