Approaches to AI 1

0. Chess is a two person game, later we will study search methods for two person games. For now, we will look at the state-space of the game of chess.
The chess board with its pieces, their positions and who to move next (Black or White) constitute a state.
A chess move (that takes us from one board position to another) defines a state transition.
Which of the following properties are true about the state-space of the game of chess?
1. Exponentially growing search space
2. Decimal representation of the number PI(ratio of circumference to radius of a circle) has more digits than the number of states in the game of chess
3. The state-space is not reversible
4. There are subspaces (subsets of the state-space) which are reversible
5. A pawn move, and independently, a piece capture are irreversible state transitions
6. Every state has at least one incoming edge
7. There are several states that have no outgoing edges

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *