TalkChess.com

Help - we need to find Fern someone who will analyse his need for mystery, provide complete information about it, and then fully resolve it.

I would say Linux - but the truth is that this is not because it is necessarily the best choice for you - it's an emotional reaction against Micro$oft - a company that has been found guilty of illegal anti-competitive practices by both US and EU courts, and which, IMHO, charges too much for its prod...

I also believe, though, that with the higher standard of play that will result from bigger searches, positions where particular pieces of knowledge are important are just simply less likely to be encountered. No. My example of endgame knowledge about wrong bishops when rook pawns are involved could...

Even the best chess engines make mistakes all the time. I guess that if two strong chess engines play a game of 100 moves, there are at least 30 mistakes in it. So 0.15 would be a reasonable approximation of the probability of making a mistake (as defined in the thread's first post) using current t...

As I have said before - time to switch to go. It would be fun to try to work out all the mathematical symmetries that exist on a Go board - or use other branches of mathematics (group theory?). Go might just succumb to this line of attack. Why should Go players be exempt from Michael Adams style hu...

My definition of "near-perfect" play is making mistakes only very rarely (e.g. 1 mistake per 10,000 moves). Note that by your definition missing consecutive one-move mates still counts as "near-perfect" play if the final result of the game is unchanged. So the near-perfection could actually look pr...

Prob.of mistake |****************************** | | | | | | | * ------------------------------- depth Many endgames need hundreds of ply to solve. Are you saying that unless an end game is fully resolved, there is a high (> 0.5) probability that a computer with a weak eval will make a mistake (as d...

I think that this is not correct that programmers remove knowledge from the evaluation because of faster computers. Programmers may remove knowledge because the knowledge is counter productive but I need to see cases when they remove knowledge because it is only counter productive for faster comput...

Ultimately, chess is about avoiding mistakes. I am defining a mistake as a move that has one of the following effects: * turns a winning position into a drawn position * turns a winning position into a losing position * turns a drawn position into a losing position A computer that plays perfectly ne...