196
Méthodes de Monte-Carlo pour le s jeux à un joueur
#include
#include
using namespace s td ;
const int MaxSize = 15;
const int MaxProblem = 20;
class Move {
public:
int nbLocations;
int locations [MaxSize * MaxSize ];
Move () {
nbLocations = O;
}
void add (int !oc ) {
}
locations [ nbLocations ] = !oc;
n bLocations ++;
void sort () {
}
} ;
std :: sort (locations , locations + nbLocations );
class Seen {
public:
char se en [ MaxSize * MaxSize ];
void init () {
memset (seen , 0, MaxSize * MaxSize * size of (char));
}
bool test (int !oc ) {
}
r et u r n ( se en [ 1 o c ] == 0 ) ;
void set ( in t !oc ) {
seen [!oc] = l;
}
} ;
static Move moves [MaxSize * MaxSize ];