IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i7p1016-d776728.html
   My bibliography  Save this article

On Primitive Recursive Characteristics of Chess

Author

Listed:
  • Vladimir Kulyukin

    (Department of Computer Science, Utah State University, Logan, UT 84322, USA)

Abstract

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.

Suggested Citation

  • Vladimir Kulyukin, 2022. "On Primitive Recursive Characteristics of Chess," Mathematics, MDPI, vol. 10(7), pages 1-43, March.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:7:p:1016-:d:776728
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/7/1016/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/7/1016/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vladimir A. Kulyukin, 2023. "On Correspondences between Feedforward Artificial Neural Networks on Finite Memory Automata and Classes of Primitive Recursive Functions," Mathematics, MDPI, vol. 11(12), pages 1-25, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:7:p:1016-:d:776728. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.