Below is the board for a simple game, with two tokens, A and B:

Player A moves first, and the two players take turns moving. Player A can move either one

square right or two squares right while player B can move either one square left or two squares

left. One restriction is that both tokens cannot occupy the same square. The winner is the

player who reaches the opposite end first.

For any position define the heuristic function:

$h-[Numberof$ squares A has moved$]-[Numberof$ squares $B$ has moved$]$

$($a$)$ Draw a game tree for the first four moves $($ A moves, $B$ moves, A moves, $B$ moves$).$

Solution: