The Mate-in-n Problem of Infinite Chess Is Decidable.

Dan Brumleve Joel David Hamkins Philipp Schlicht

Published in: CiE (2012)

Keyphrases

artificial intelligence
computer chess
first order logic
evaluation function
game tree search
heuristic search
game playing
computation tree logic
imperfect information
knowledge base
brute force
search space
board game
finite sets
polynomial hierarchy
existentially quantified
neural network