198
}
}
Méthodes de Monte-Carlo pour le s jeux à un joueur
stack [O]++;
stack [ stack [O]] = neigh;
}
}
if (( l % MaxSize ) != 0) {
neigh = l - 1;
}
if (color [neigh ] == c)
if (seen. test (neigh )) {
seen. set ( neigh );
move. add ( neigh );
stack [O]++;
stack [ stack [O]] = neigh;
}
if (( l % MaxSize ) != MaxSize - 1) {
neigh = l + 1;
}
i f ( c o l o r [ ne i g h ] == c )
if (seen. test (neigh )) {
seen. set ( neigh );
move. add ( neigh );
stack [0]++;
stack [ stack [0]] = neigh;
}
bool moreThanOneMove ( int c) {
Seen seen;
}
Move mv;
int nb = O;
se en . in i t ();
for (int i = O; i < MaxSize * MaxSize; i++)
if (color [i] == c)
if (seen. test (i)) {
buildMove ( i , seen , mv );
nb++;
}
if ( nb > l)
return true ;
return false;
void findMoves ( int tabu = 9) {
Seen seen;
nbMoves = O;
seen. init ();