There is more information recently that AlphaZero has been trained to be the best chess program after 4 hours of learning (in chess). I am wondering how the AI network could have been modeled for this program?
This question is better on https://chess.stackexchange.com/. I've answered some of them. There's no reason to repeat here.
Please ask a specific question if you have any. I've read the paper, but I can't do anything unless you make yourself clear what you want.
I am not familiar with AI so my idea could be basic:
- Input: list of booleans indicating if given field contains given checker (e.g. isA1MyRook, isA1MyKnight, isA1MyBishop, ..., isA2MyRook, isA2MyKnight...)
- Output: List of all possible moves including forbidden ones (e.g. Ra1-a2, Ra1-a3 etc.) I thinks that this is far from optimal but I think that this is a good starting point.