Cracking Go 328
prostoalex writes "IEEE Spectrum looks at current trends in artificial technology to crack the ancient Chinese game of Go, which theoretically has 10^60 potential endings. Is conquering the game via exhaustive search of all possibilities possible? 'My gut feeling is that with some optimization a machine that can search a trillion positions per second would be enough to play Go at the very highest level. It would then be cheaper to build the machine out of FPGAs (field-programmable gate arrays) instead of the much more expensive and highly unwieldy full-custom chips. That way, university students could easily take on the challenge.'"
I don't care how good it is (Score:5, Funny)
Re:What about this idea? (Score:1, Funny)
Re:Exhaustive? (Score:5, Funny)
Unfortunately for him, he is working for Microsoft labs in China, and since 2008 is well known to be the projected year of linux on the desktop, Microsoft won't be around long enough to continue funding his project. Sigh.
Re:Sure it is possible to search 10^60 (Score:5, Funny)
Nice. (Score:5, Funny)
Sometimes I imagine Go as the essence of life, distilled into a binary adversarial form. Of course, I snap out of it when my neighbours explain I can't just take their cars because "they had no liberties" when I double-park.
Re:I don't care how good it is (Score:4, Funny)
Re:I don't care how good it is (Score:5, Funny)
Re:I don't care how good it is (Score:5, Funny)
would have had two levels of funny if you posted AC.
Re:What about this idea? (Score:4, Funny)
Heheh. Bewbiez.
Re:I don't care how good it is (Score:2, Funny)