I have read the paper: result is impressive!
Honestly I didn't think it was possible because my understanding was that chess is more "computer friendly" than Go....I was wrong.
It is true, SF is not meant to play at its best without a book and especially 1 fixed minute per move cuts out the whole time management, it would be more natural to play with tournament conditions, but nevertheless I think these are secondary aspects, what has been accomplished is huge.
Google's AlphaGo team has been working on chess
Moderators: hgm, Rebel, chrisw
-
- Posts: 2684
- Joined: Sat Jun 14, 2008 9:17 pm
-
- Posts: 2272
- Joined: Mon Sep 29, 2008 1:50 am
Re: Google's AlphaGo team has been working on chess
I have a question that perhaps you can answer right away.Rémi Coulom wrote:The paper says they use 5,000 first-generation TPUs, and 64 second-generation TPUs. Such hardware is not available for sale, but might be similar to a V100 in terms of computing power. A single PCI V100 costs about 10,000 Euros in Europe. But if you buy 5,000, you can certainly get a much cheaper price. Of course you also need the computers that host them, and the power supply (250W*5,000 = 1.25 MW).xcombelle wrote:The AlphaZero training system costed $ 4 millions of hardware. (figures given for alpha go zero, don't have source under hand)Money would be a better measure.
This being said, I would not be surprised if their trained network could still beat Stockfish on ordinary hardware. And I expect deep-learning hardware will become much cheaper and commonplace in the future. Even cell-phones are starting to have deep-learning hardware now.
A distributed open-source effort might be enough to produce a super-strong network in a few months. This is what Gian-Carlo has started with Leela in Go. Maybe he'll do it for chess and shogi, too.
Almost a 1000 CPU years went into tuning SF until today....
Would you say that the training of AlphaGo required less or more resources than this?
Ideas=science. Simplification=engineering.
Without ideas there is nothing to simplify.
Without ideas there is nothing to simplify.
-
- Posts: 438
- Joined: Mon Apr 24, 2006 8:06 pm
Re: Google's AlphaGo team has been working on chess
According to the paper, they trained for 9 hours, over 5000 TPUs.Michel wrote:I have a question that perhaps you can answer right away.
Almost a 1000 CPU years went into tuning SF until today....
Would you say that the training of AlphaGo required less or more resources than this?
5000 * 9 / 24 = 1875 TPU-days
A TPU is a bit like a super-powerful GPU. A very rough estimate may be that 10 GTX 1080 ti may have the power of a TPU. So if you get 100 people volunteering their GPU full time, that would take about 6 months. That looks doable.
-
- Posts: 4366
- Joined: Fri Mar 10, 2006 5:23 am
- Location: http://www.arasanchess.org
Re: Google's AlphaGo team has been working on chess
Stockfish does such heavy pruning that it is throwing away most of the nodes in its search trees. But the ones it does search, it searches very deeply. I see a lot of high-level computer games won by tactics or by endgame play that requires deep search. Shannon Type II (selective search) has never worked well in any of the past 5-6 decades. But maybe this effort is showing that eval is more important than has been thought, and search less important.
--Jon
--Jon
-
- Posts: 7218
- Joined: Mon May 27, 2013 10:31 am
Re: Google's AlphaGo team has been working on chess
What I understand is that the neural network predicts the winning probabilities for each valid move in a position.
Don't understand that these predictions will be good if it doesn't do a search but only simulation.
So how is it possible that monte carlo simulation is better than an alpha beta search.
Don't understand that these predictions will be good if it doesn't do a search but only simulation.
So how is it possible that monte carlo simulation is better than an alpha beta search.
-
- Posts: 186
- Joined: Fri Oct 10, 2014 10:05 pm
- Location: Berkeley, CA
Re: Google's AlphaGo team has been working on chess
The trick is to stop thinking in terms of tactics and search, and start thinking in terms of learning a really complex evaluation function. As the paper explains, alpha-beta can amplify any error in the evaluation function, whereas MCTS (plus a little noise) averages it out. So tuning alpha-beta is, in a sense, harder.Henk wrote:What I understand is that the neural network predicts the winning probabilities for each valid move in a position.
Don't understand that these predictions will be good if it doesn't do a search but only simulation.
So how is it possible that monte carlo simulation is better than an alpha beta search.
-Carl
-
- Posts: 186
- Joined: Fri Oct 10, 2014 10:05 pm
- Location: Berkeley, CA
Re: Google's AlphaGo team has been working on chess
Neural nets scale well on cheap (per FLOP) SIMD hardware, so you'll definitely pay more for the traditional engine at the same level of performance.Xann wrote:Time is misleading in DeepMind's papers, as they use thousands of "computers" (not even commercially available). Money would be a better measure.
-Carl
-
- Posts: 10282
- Joined: Thu Mar 09, 2006 12:37 am
- Location: Tel-Aviv Israel
Re: Google's AlphaGo team has been working on chess
Daniel Shawul wrote:Most of us here suspected that this could happen once Giraffe showed it can beat Stockfish's eval.
Just the fact that the new approch to chess programming worked incredibly well is fantastic even if it didn't beat the best.
Daniel
How do you decide that giraffe's evaluation is better than stockfish?
If the definition is by using fixed number of nodes with the same search function then having a better evaluation than stockfish is easy if you do not care about time.
Evaluation is basically a function that take a position and return a number.
In this case I can define the evaluation of the position to be the result of the search of stockfish when it searches 20 plies forward.
I am sure this evaluation is better than stockfish's evaluation and can beat stockfish's evaluation when you search the same number of nodes(of course you do not count the nodes that you search to calculate the evaluation because they are defined to be part of the evaluation).
Uri
-
- Posts: 12540
- Joined: Wed Mar 08, 2006 8:57 pm
- Location: Redmond, WA USA
Re: Google's AlphaGo team has been working on chess
They used TPU not GPU (I suppose, did not read the paper yet, but TPU were used for Go).EvgeniyZh wrote:You suppose to run Stockfish on GPU?)mar wrote:While this is indeed incredible, show me how it beats SF dev with good book and syzygy on equal hardware in a 1000 game match.
Alternatively winning next TCEC should do
AlphaZero din't used neither book nor syzygy, neither did stockfish. That sounds like apples to apples.mar wrote:They are scientists so it would be nice to compare apples to apples.
They are special vector processors like GPU in having massive parallel operations.
Taking ideas is not a vice, it is a virtue. We have another word for this. It is called learning.
But sharing ideas is an even greater virtue. We have another word for this. It is called teaching.
But sharing ideas is an even greater virtue. We have another word for this. It is called teaching.
-
- Posts: 38
- Joined: Thu Mar 30, 2017 8:52 am
Re: Google's AlphaGo team has been working on chess
Using Stockfish 181117, at move 30 it finds 13. Ncxe5 as best move, and changes at depth 34 to 13. Qc3 with eval = -0.37.Fulvio wrote:This is sci-fi. I do not have a 64 core machine but on my pc Stockfish do not sacrifice a Knight for 2 pawns:
1.e4 e5 2.Nf3 Nc6 3.Bb5 Nf6 4.d3 Bc5 5.Bxc6 dxc6 6.O-O Nd7 7.Nbd2 O-O 8.Qe1 f6 9.Nc4 Rf7 10.a4 Bf8 11.Kh1 Nc5 12.a5 Ne6 13.Ncxe5?
I'd say it is normal.