CareerCup

Mini-Max Algorithm

define "perfect" move
if that's coded and working, then the rest is simple

BDD is the way to do it

Draw a tree containing all the moves of self and opponent. From all the leaf nodes Do a back tracking to current state, considering everyone will make a perfect move, avoid all the redundant paths for trivial cases, and calculate the possibilities.

int check(int i,int j,int user)
{

if(ttt[0][j]==user && ttt[1][j]==user && ttt[2][j]==user)
return 1;

if(ttt[i][0]==user && ttt[i][1]==user && ttt[i][2]==user)
return 1;

if(ttt[0][0]==user && ttt[1][1]==user && ttt[2][2]==user)
return 1;

if(ttt[0][2]==user && ttt[1][1]==user && ttt[2][0]==user)
return 1;

return 0;
}

Look up table

gadha