4 ms·
Why didn't you go for monte carlo tree search? Wouldn't that have been more robust to handle different games?
by Ihmahr 13y ago
Why didn't you go for monte carlo tree search? Wouldn't that have been more robust to handle different games?
- gamegoblin 13y agoNegamax is very good for a wide variety of relatively simple games. It will utterly fail for Go, but I've written negamax AIs that dominate any casual player at chess, connect 4, reversi, gomoku, etc. They become yet stronger if you add a quiescence search.