Loading...
Please wait, while we are loading the content...
Similar Documents
On Primitive Recursive Characteristics of Chess
| Content Provider | MDPI |
|---|---|
| Author | Kulyukin, Vladimir |
| Copyright Year | 2022 |
| Description | 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 whose turn it is to play on the last board of the game. It is also shown that there exist primitive recursive procedures to compute optimal continuations of unfinished games within specified numbers of future moves and that the set of chess games is recursive. |
| Starting Page | 1016 |
| e-ISSN | 22277390 |
| DOI | 10.3390/math10071016 |
| Journal | Mathematics |
| Issue Number | 7 |
| Volume Number | 10 |
| Language | English |
| Publisher | MDPI |
| Publisher Date | 2022-03-22 |
| Access Restriction | Open |
| Subject Keyword | Mathematics Computability Theory Theory of Recursive Functions Number Theory Game Theory Chess |
| Content Type | Text |
| Resource Type | Article |
