# Library Exercise_3_5_2_13

## Problem

Let P be a chess-playing program. Given any position (including
the choice of whose turn it is), P will make a move. Is this an
example of a discrete dynamical system? How do the rules for
ending the game in a win or draw play out in this model? (Look
up online how chess games end if you don't know.)