I'm saying this (scoring, play-out) has been a difficult problem, which was not solved even a small number of years ago, and is still not considered straightforward. Even if it is solved correctly now, that's only a start.
I would also note that Monte Carlo is by definition a heuristic method - it is statistical and not guaranteed to be optimal.
So is the endpoint evaluation in chess programs. This isn't a difference between Go and the other games. (In fact, pretty much nothing in your original post is)
There are extensive wikipedia articles on what constitutes a winning endgame in chess, as the board simplifies towards the end of the game:
https://en.wikipedia.org/wiki/Endgame_tablebase says "All chess positions with up to 6 pieces have been solved"
So, I disagree. Even if you don't count this as a theoretical difference, it is a practical difference.
The exact same thing can be done in go, scoring a finished game is trivial. The strength of the program simply isn't determined much by correctly identifying and scoring terminal positions, but the intermediate ones. And for both chess and go, one very much uses heuristics which are often wrong.
If the heuristics were never wrong, you wouldn't have to do the tree search part at all.
Endgame databases only have a tiny effect on the strength of chess programs (a common misunderstanding!) just because it's not very common for the game to be still "flippable" by the time they become relevant. In all the other positions, you need the heuristics.
The situation for checkers on the other hand, is very different. There the endgame databases were critical for solving the game, but due to mandatory capturing rules the search space reduces much faster.
Edit: Not sure why HN won't let me reply. But anyway: the error that you're both making is assuming that the positions in which humans stop and score are "endgame" or "finished" positions. That's not at all the case! A game is finished if there are no more legal moves besides filling one's own eyes. Counting at that point is trivial because all the life & death situations are "resolved". Monte Carlo programs play until those positions, not the ones where a human would stop the game.
(if you now bring up seki, you get half a cookie)
AGA Rules: 9) Ending the Game: Two consecutive passes signal the end of the game.
New Zealand rules: The game is finished when both players agree that there are no more worthwhile moves.
Humans agreeing on a score and outcome has little to do with what a program has to do to calculate this score.
I still don't see your argument. Humans and humans are capable of agreeing on a score with those rulesets. Computers are also capable of following the ruleset and agreeing on the score. Computer vs. human games are not playing by a different ruleset. By that ruleset, the game is over when both sides pass.
I've also encountered this bug. Please bring it up with dang.
Click the [link] link to get a reply box quicker.
But the poster is wrong in saying that this means computers need to use heuristics. Indeed, the recent breakthroughs in Go-playing programs come from removing heuristics that previously helped the programs prune the tree space and instead just using Monte Carlo to simulate all possibilities.
There's a tricky balance, because incorporating too much knowledge/heuristic use can make the program miss good but surprising moves. Nonetheless, the trend seems to be heavy playouts.
One of the surprising results is that having stronger play between opponents in the rollout phase does not always equate with a successful search. Having a balanced strategy -- that is, one that does not introduce a bias for either player -- appears more important.
Would that be pretty much impossible with Go on current hardware and software?
If true, does it mean a computer (or an Human) could win by just not conceding?
If one player would never concede you would keep playing until the board is full except for the unfillable eyes of the player that wins. Obviously that would take a long time and many negative moves of the losing player.
So you stop playing when both players are confident the game is over and agree on who has won.
By the way, the Chinese rules let solve neatly all those cases handled by special rules in the Japanese rules. The bent four in the corner is the most notable one. Playing it out with the Chinese rules is a neat explanation why that corner is defined to be dead: the surrounding player defends any weakness without losing points and starts the ko. The other player has no ko threats and dies. Those defensive moves lose points under the Japanese rules so they have to make a special rule for that shape and many others.
The only problem with the Chinese rules is that scoring takes longer and completely destroy the shape of the game: you fill in the territory of one player, take out the other's stones and count by grouping the stones in convenient shapes. Furthermore if you want to count during play you must remember how many stones have been captured because prisoners are returned to their bowl and are not stored in plain view (the score penalty is paid by not having those stoned on the board). Japanese rules are a shortcut that makes scoring easy but the tradeoff is the dictionary of special cases at the end of the game.
"Conceding" means passing. If you don't pass, you have to play. If you play when the game is effectively over, you either play in your opponent's territory and get captured, or your own, which reduces your score. If you play in your own territory enough then you can actually end up losing your eyes, and then be captured.
"Graham and Rothschild (1971) also provided a lower limit by showing that N must be at least 6. More recently, Exoo (2003) has shown that N* must be at least 11 and provides experimental evidence suggesting that it is actually even larger."*
In this case, I think it is safe to claim that the answer is at least 361!/8, though (but that may already include many truly silly games with suicidal moves in the opening or games that continue way past the time experienced players think they are over)
As for infinite games, they don't really happen much; in rulesets that make it possible for them to happen, the game is usually called "no result", and this has happened only very few times in hundreds of thousands of recorded games. Modern rulesets have "patched out" this by implementing superko or similar rules: playing a stone that would put the board in a state it was in previously (positions of the stones and which player's turn it is) is an illegal move.
For each of the (several) traditional rulesets there are positions that the ruleset can't deal with. So in order to allow a mathematical or computer analysis the rules often need to be tweaked.
A naive game theory strategy runs into a disasterous problem - the game tree is extensively longer than the 200 moves that a human will play.
So, a computer has to recognise a winning position, in a heuristic way, as well as the best players do. But, even as a total beginner, it's easy to notice Go programs sometimes get the end-of-game scoring totally wrong.
Once you've overcome this first problem, you've reduced Go to "just" a 200-move game tree.