1
1
During the first game, in 1997, New York, between the Deep Blue supercomputer against Kasparov, there was an unexpected tower move position by supercomputer.
That bug had come out the year before while training with the great master. The programmers had identified four bugs, but the fifth came out only during the first game with kasparov.
They tried in every way to understand why that error just came out that way, then, no answer, one of the programmers who created the algorithm, Joseph Hoane, corrected that bug
I would understand, mathematically, what is this error, if it as the algorithm formula, the evaluation function, the generator of moves? Can anyone tell me how usually you correct a mistake of this kind? What should you look for?
1I'm actually not sure whether this is on-topic or off-... but the question itself is fascinating, so I'm hoping someone manages something like an answer ;) – Tetsujin – 2017-01-04T20:20:59.373
While this is an interesting question, the answer is likely not something that anyone but Hoane and his colleagues know. I assume that the bug was with a specific scenario in the game, but without understanding the code it would be difficult to describe the fix. – heavyd – 2017-01-04T20:30:32.803
mmm..thanks, I find something math here and here but I don't undestand if is used Montecarlo method or algorithm like minimax based on evaluated functions to determinate move generator positions
– Peter Long – 2017-01-04T20:47:55.873