Question $2$ In the example below, you are the $x$ player in a tic$-$tac$-$toe game, with $4$ possi$-$

ble moves. For each of your possible moves, the O player has $3$ possible moves.

To evaluate a certain scenario, you use the following evaluation function:

value $V=0$

for all rows, columns, diagonals $R$ do:

if $R$ contains three $xs$ then:

$V=V+1000$

else if $R$ contains three $O$ s then:

$V=V-1000$

else if $R$ contains two $x$ s then:

$V=V+100$

else if $R$ contains two $O$ s then:

$V=V-100$

else if $R$ contains one $x$ then:

$V=V+10$

else if $R$ contains one $O$ then:

$V=V-10$

end if

end for

return $V$

Ma:

Min

Draw all the possible configurations following the actions of player $x(4$ con$-$

figurations$)$ and player configurations$).$ Evaluate the last layer

of configurations using the aforementioned evaluation function, and compute

the minimax game values for the rest of the nodes. Indicate the winning path.