Tutorials on AI

(1) Draw a depth-first tree, breadth-first tree, and
    heuristic tree for the following initial configuration 
    and goal configuration of 8-puzzle.

    initial           goal
    1 3 4             1 2 3
    8 6 2             8   4
    7   5             7 6 5

(2) Draw a minimax tree and alpha-beta tree for
    the following sequences at the level of leaves.

    3  4  2  0  5  4 -1  6 -2 -1  4 -3  6  0  3 -3

   -3  3  0  6 -3  4 -1 -2  6 -1  4  5  0  2  4  3

The second is reverse of the first. From this, alpha-beta
cuts are heavily affected by order of evaluation of nodes.
Try the following sequence.

   -3 -4  2  0  5  4  5  6 -2 -1 -2 -3  6  0  3 -3

(3) Draw a minimax tree and alpha-beta tree for
    the tic-tac-toe game of depth 2, and  an alpha-beta
    tree of depth 5. For an alpha-beta tree, you can
    expand a node in such a way that a cut can happen
    if and as soon as possible. You use the following
    starting node, as the tree from the empty node 
    would be too big.

        ----------
        | x| x| o|
        ----------
        |  | o|  |
        ----------
        |  |  |  |
        ----------
    
For depth 2, use the evaluation function that counts
the number of open rows, columns and diagonals. For depth 5,
the evaluated values will be 99 or -99, as the tree goes
to the bottom.
 For the tree of depth 5, you can stop at any node that
is a winning situation for either player.

(4) Beat the Othello pprogram on the web page as a human player.