3 ms·
The machine learning approach was applied to Go because there aren't any good heuristics known for the game of Go. In chess, a DAMN GOOD heuristic is that Quee
by dragontamer 9y ago
The machine learning approach was applied to Go because there aren't any good heuristics known for the game of Go.
In chess, a DAMN GOOD heuristic is that Queens are worth 9 points, Rooks are worth 5, Bishops / Knights are worth 3, and Pawns are worth 1.
A few additional heuristics regarding "two bishops bonus", "passed pawn bonus", "Castled King bonus" and the like work really well in Chess.
----------
There's no equivalent to that in Go, so the best researchers could do was throw machine learning at it and hope for the best. EDIT: I'm well aware of Joseki (aka Openings) and Tesuji (Go "Tactics"). But Tesuji are not very easy to program.
The alternative is maybe to apply the Monte-Carlo Search Tree to Chess instead of Go. All games end in Chess (due to the 50-move draw rule). But Chess is incredibly tactical, and its far more important to exhaustively see all possibilities 3 or 4 steps ahead rather than try to figure out how the endgame's position might look like.
So Alpha-Beta pruning is likely a way better algorithm for Chess. A Machine Learning algorithm would have to figure out how to beat the current state of hand-programmed heuristics, which is not only incredibly efficient (due to bitboards and other optimizations), but also incredibly powerful.
- lozenge 9y agoAlphago Zero has beat all previous Go engines without examining any external games. I don't see any reason to believe Chess is a special game where humans understand it better (to write AIs) than computers can do "on their own". They are both turn-based deterministic games where the only asymmetry is which player gets the first turn.
- Recursing 9y agoLots of the parameters of the evaluation function are (at least in part) automatically tuned. Here https://chessprogramming.wikispaces.com/Automated+Tuning https://chessprogramming.wikispaces.com/Automated+Tuning you can fnd some of the most successful methods
- dragontamer 9y ago> without examining any external games That's only a big deal in Go circles, where Go computers have only been super-human for less than 2 years. Chess AIs are well known to have been super-human for decades now. Chess AIs are able to build the Chess game database backwards (ie: Tablebases) AND forwards (Opening Databases). There's very little human knowledge involved in a 6-move Chess Tablebase: https://en.wikipedia.org/wiki/Endgame_tablebase https://en.wikipedia.org/wiki/Endgame_tablebase . Indeed, computer-generation of Tablebases have REFUTED human knowledge, and modern Tablebases are way stronger than the entirety of chess knowledge that existed before computer analysis. Building Chess AIs "without human knowledge" has been going on for a long time now. The thing is, its very difficult to beat the SPEED of an assembly-language tuned count of bishop or rook moves. IE: The Magic Multiply / Bitboard method: https://chessprogramming.wikispaces.com/Magic+Bitboards https://chessprogramming.wikispaces.com/Magic+Bitboards ---------- The Chess AI game is played very differently from the Go AI game. In Go AI, "superhuman" programming techniques are still in its infancy. In Chess AIs, the game is mostly settling down upon speed, speed, SPEED. In many cases, a weaker heuristic that sees +1 or +2 moves into the future (due to being a little bit faster) is far better than a stronger heuristic that takes a bit longer to calculate. As such, a huge amount of Chess AI effort is in optimizing routines at the assembly level. Or perhaps data-structures that allow Opening Databases and Endgame Tablebases to be more efficiently utilized. In contrast, a lot of Go AI effort is in representing search trees... but not so much in speed or optimization right now.
- thom 9y agoI see no reason the two approaches couldn't be combined - use machine learning to identify new patterns and weights to help evaluate positions, but compile them into efficient operations to use them in existing engines.
- dragontamer 9y agoThere's no easy way to turn a set of 10-layer Neural Network weights into faster optimized assembly language. You can optimize the Neural Network so that maybe it runs faster (using NN specific hardware like maybe TensorCores or whatever), but I don't think anyone has any way to "generalize" a Neural Network into faster code.