3 ms·
This may not be what you mean, but it sounds like you're saying the computer just plays hands with favorable odds of getting winning cards. That's trivial and n
by DennisP 12y ago
This may not be what you mean, but it sounds like you're saying the computer just plays hands with favorable odds of getting winning cards. That's trivial and not at all what this is doing. It's finding the game-theory-optimal play, which means it bluffs in the most effective way possible.
It does that with the assumption that the opponent is also very strong, so it doesn't attempt to exploit weaknesses. If you try to exploit weaknesses, you have to vary from optimal play, thus opening up your own weaknesses. The software doesn't do that, it just plays a perfect game.
- ikeboy 12y agoIf perfect play is known, why not just use that? The article compared this program with perfect play, which means that perfect play must be computable. I'm confused.
- DennisP 12y agoPerfect play exists but is extremely difficult to compute because it's such a large problem. But they've shown that this program comes very close. Perfect play also exists in games like chess and checkers. Checkers has been completely solved and computers can play it perfectly. This is not true for chess, though computers play quite well. Go is even harder and the best humans easily beat the best Go computers.
- ikeboy 12y agoDo you mean they only tested it against perfect play for a subset of hands, but ran their program for all hands, and the "close to perfect play" is only statistical? Otherwise, how could they show it's close if they can't compute perfect?