Abstract
Abstract : A great deal of effort has been expended in connection with the use of digital computers to play chess and checkers. The most successful has been the checker-playing program of Samuel. It is of some interest then to indicate how the theory of dynamic programming can be used to determine optimal play in the great majority of Pawn-King end-games in Chess, with computers currently available, and in all probability, to determine optimal play for the entire game of checkers. The basic methods are outlined involving as they do the concept of semigroups in structure.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
