Honestly, is nothing sacred?
Following on the heels of yesterday’s reported attack on the Rubik’s cube is this posting over at Slashdot on a recent IEEE Spectrum article on using AI to attack the ancient Chinese game, Go, with its 10^60 possible 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.