On pruning search trees of impartial games

DOI10.1016/j.artint.2020.103262zbMath1433.91039OpenAlexW3013706901MaRDI QIDQ1989407

Piotr Beling, Marek Rogalski

Publication date: 21 April 2020

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2020.103262

zbMATH Keywords

combinatorial game theoryNimimpartial gamegame treenimberChompCramMex functionSprague-Grundy value

Mathematics Subject Classification ID

Combinatorial games (91A46) Algorithmic game theory and complexity (91A68)

Uses Software

• Chomp3Rows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Sprague-Grundy function of the real game Euclid
• Nimbers are inevitable
• The Sprague-Grundy function for Wythoff's game
• Nimhoff games
• An analysis of alpha-beta pruning
• Global and local game tree search
• Periodicity in one-dimensional peg duotaire
• The Sprague-Grundy function of the game Euclid
• Computer analysis of Sprouts with nimbers
• Never Rush to Be First in Playing Nimbi
• A Curious Nim-Type Game
• Three-rowed CHOMP
• The hexad game

This page was built for publication: On pruning search trees of impartial games