14.11.2012 Views

2. Philosophy - Stefano Franchi

2. Philosophy - Stefano Franchi

2. Philosophy - Stefano Franchi

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

204<br />

C HESS, GAMES, AND FLIES<br />

Let me try to convey a deeper appreciation of Shannon’s program with the help of a<br />

(traditional) tree diagram. Consider the following figure. The ovals, or nodes, represent<br />

possible configurations of the chessboard, and the lines connecting them stand for the ac-<br />

tion performed when a chess piece is moved.<br />

.<br />

Possible move 1<br />

P move 21 P move 22 P move 41<br />

We can consider the initial position of the chessboard as the root of the tree, the first row<br />

as the possible first moves by the white player, the second row as the possible counter-<br />

moves by the black player, the third possible counter-counter-moves by the white player,<br />

etc. It is this tree that has, as Shannon reports, approximately 10120 nodes. Set issues of size<br />

aside for a moment, however, and focus on the structure.<br />

The tree can be created one step (one node, that is) at the time by the recursive appli-<br />

cation of the rules of the game. The complete tree is of course impossible to create, but the<br />

search procedure does not have to rely on a complete tree if it settles for less than optimal<br />

results (Whereas a less-than-complete game theoretic matrix is useless, since maximin<br />

techniques require the whole matrix to operate).<br />

Start<br />

P move 2 P move 3 P move 20<br />

P move 42<br />

The second thing to notice is that the tree does not represent the “perfect” game, or in-<br />

deed any game, but the collection of all possible chess games, from the most trivial to the<br />

grandmaster’s masterpiece. In fact, every complete vertical path of the tree begins with the<br />

initial position and terminates, after a variable number of moves, either with a victory for<br />

white or black or with a draw, and as such stands for a complete game. The tree as a whole<br />

represents the space of “chess” as such. Individual games can be recomprehended as proper<br />

parts of the complete structure (i.e. as complete vertical paths.) The perfect game would be-<br />

come possible after the complete tree is in place, since to play it is necessary to know the<br />

.<br />

White<br />

Black<br />

White

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!