2 ms·
>>I don't know whether they customised the AI for each game, but I suspect if the input and output layers were wide enough to accommodate the largest game they
by YeGoblynQueenne 9y ago
>>I don't know whether they customised the AI for each game, but I suspect if
the input and output layers were wide enough to accommodate the largest game
they could use the same one for each. The Markov engine does have to know how
to make all legal moves from any game position, but coding that isn't rocket
science or particularly time consuming. The AI does _not_ start out knowing
those rules - it learns them from the Markov engine. It's all very DRY.
Coding a set of rules for chess may not be a big deal. Encoding it into a
neural network architecture, so that the network only explores valid game
states, _is_ a big deal, like the article says.
The paper itself clarifies that the network architecture is matched to the
game board grid. Each position and each move are represented by features
described as sets of "stacked" planes (i.e. 2d feature vectors). So for example,
in chess, the board is a set of 8 x 8 planes, and the movement of a piece is
represented by a set of 56 planes for "queen moves" (continuous moves in any
direction) and another 8 for "knight moves" (jumping over pawns). How they
constraint specific pieces to subsets of those planes, is not explained, or I
missed it.
That's not an obvious setup, neither is it a trivial one. More to the point,
it's absolutely not something you can just copy and paste to an arbitrary
other game- it can only be applied to a game that uses the same board and same
pieces as chess. So, for example, no, you couldn't use that same architecture
to represent a game of poker.