 Claude Shannon, in 1949, laid out the principles of algorithmic solution of chess.In that paper, the game is represented by a "tree", or digital data structure of choices (branches) corresponding to moves.The nodes of the tree were positions on the board resulting from the choices of move.