= 27d567bc2d48d9f40e9ccc20ea370b15)
gregconen comments on Play for a Cause - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (57)
If you're thinking about the same thing I am, the player was "not-all-that-good" at chess, but knew a lot about chess programs and their different relative weaknesses and strengths.
Hypothetically, I wonder if that approach could be constructively imitated by a computer. A meta-chess program, dividing it's computational resources between several subprograms, and combining their input to play better than the subprograms would if they had the full computational resources.
I think we are indeed thinking of the same instance. And yes, it would be interesting to try getting a computer to play that way.
Here's a nice exploitation of a similar idea: The Fastest and Shortest Algorithm for All Well-Defined Problems; see also the discussion at Hacker News, where in particular you might want to read the comment from me that explains roughly what's going on and the comment from Eliezer that explains one way in which Hutter's description of his algorithm claims more than it really delivers. None the less, it's a very neat idea.