On Primitive Recursive Characteristics of Chess
Several characteristics of chess are investigated with methods of computability and number theories. It is shown that for an unfinished game it is primitive recursively decidable whether the game is winnable, drawable, or absolutely losable within a specified number of future moves for the player wh...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/7/1016 |