I noticed in a paper that the mate-in-n problem of chess, even played on an infinite board is decidable. The mate-in-n problem of innite chess is decidableI believe the paper assumes only traditional chess pieces are used.What if one of the chess pieces is a huygens? (A huygens is a chess piece which jumps prime numbers of squares).Is the mate-in-n problem of chess on an unbounded board with each color using traditional chess pieces plus at least one huygens also decidable?
Is the mate-in-n problem of infinite chess with each color using traditional pieces plus one huygens decidable?
computability;undecidability;board games