4 ms·
Indeed. APHID doesn't scale well and it will be hard to distribute YBWC efficiently but we think we have a shot at it with very short compute windows for each w
by sylvinus 15y ago
Indeed. APHID doesn't scale well and it will be hard to distribute YBWC efficiently but we think we have a shot at it with very short compute windows for each worker. We may also look at other algorithms but currently a variation of YBWC seems the most promising.
In terms of strength, we'll add the UCI protocol to be able to run games against other engines. We'll see how it performs but we don't expect to beat Stockfish easily, even with a very large number of nodes. That will be part of the experiment and we'll be happy to publish the results.
Now, another path to get real performance would be to find a way of using webGL on the workers. Folding@home has proven it's sometimes 10x more efficient than using CPUs. If we can manage to do that then we might have a shot at being both the largest and strongest AI...
- jvandenbroeck 15y agoYou might have a look at Monte Carlo Tree Search & improvements they made on it for game playing. It's easy to parallelize and has had amazing results with Go. You might also combine it with a moves/games database and play variations on these games according to a softmax distribution. (instead of playing random games with classic MCTS) I think this will work much better than tree search but still, I think it will be really hard to beat eg. Stockfish. You got nothing with lots of processor power if you're doing the wrong calculations:)
- sylvinus 15y agoThanks for the pointer! We'll definitely look into it.
- gcp 15y agoFolding@home has proven that embarrassingly parallel problems run well on embarrassingly parallel architectures. Computer chess is not one of those. Forget about using the GPU for chess. Just getting that to work somewhat decently is a huge achievement - which no-one has succeeded in so far. Some people, when they see a problem, think: "We'll use the GPU". Now they have 2 problems.
- sylvinus 15y agoFair point. Though I'll have to get burned trying before being convinced it's that complicated :) However webGL is not in the critical path of the Guinness Record thing, so I'll happily trust you for now!
- 0x12 15y agothis guy might have a hint or two, or maybe you could collaborate if you go that way: http://blog.cudachess.org/ http://blog.cudachess.org/