< Earlier Kibitzing · PAGE 21 OF 21 ·
|Jul-21-16|| ||keypusher: <Howard: Sounds rather presumptuous to me---it would hardly have hurt for Byrne to have played on for only another 3-4 moves at the most, just to be sure.>|
No, it's the opposite of presumptuous. What would be presumptuous would be thinking that Fischer had sacrificed a piece for no reason.
Anyway, Byrne has written about this game, and is quoted here. After ...Nxg2, he realized what Fischer was up to, though I don't know when he worked out the full combination.
Everyone from Fischer on down is sorry he didn't keep playing, not because it would or wouldn't be presumptuous but because you just don't see moves like ...Re1+ over the board very often.
|Jul-26-16|| ||Howard: If I recall correctly, an article in British Chess Magazine about 15 years ago called "...Re1+" one of the greatest moves every played...|
....even though it didn't actually appear over-the-board!
|Feb-22-17|| ||Jimmy720: memorize|
|Mar-09-17|| ||RookFile: Usually when you play a King's fianchetto in these type of openings, it's a little safer for defense of white's king compared to more classical approaches. That's just one of the things that makes this game so remarkable.|
|Mar-09-17|| ||kevin86: Fischer was a brilliant player, though lacking in other facets of his life.|
|Mar-09-17|| ||offramp: In order to fully comprehend this game you have to read Fischer's comment at A Reinhard vs Fischer, 1963.|
|Mar-09-17|| ||MissScarlett: I believe the last word on this game was uttered by Elliott C Winslow.|
|Mar-09-17|| ||AylerKupp: <Howard> Maybe what British Chess Magazine actually said (or meant) was that ...Re1+ was one of the greatest moves never played ... :-)|
I have a magazine/book titled "The 100 Most Influential People Who Never Lived". People (characters) like Sherlock Holmes, James Bond, etc. Quite a fun read.
|Mar-09-17|| ||Petrosianic: In order to fully comprehend this game you have to read Fischer's comment at A Reinhard vs Fischer, 1963.|
That will only mislead you. That was made at a particularly unobjective time of Fischer's career, when he was saying things like that the King's Gambit was busted. Black isn't really better in that position, nor will that position help you to understand this game.
But if you'd really like to understand this game better, have a look at a few Black victories in the Tarrasch Defense.
|Mar-09-17|| ||Petrosianic: <Howard> <So, why wouldn't Byrne have played on for a few more moves just to make sure?>|
If it makes you feel any better, if Byrne HAD played on, you probably wouldn't have seen Re1 anyway. Since his resignation shows that Byrne DID see Re1, then he wouldn't have played that line.
Like, for example 22. Nf3 Qh3+ 23. Qg2 Qf5 24. Nd5 Bxd5 25. Rxd5 Qxd5, and White's an exchange down and totally busted, but it's not as flashy as the Re1 line.
|Mar-09-17|| ||sudoplatov: While there is always a "horizon effect" is always a problem, increasing what computer programmers term depth of search does not entail any narrowing of search trees. The alpha-beta always returns the value of the game tree that a full search would (it's provable). Problems creep in through traps deeper than a search or just an incorrect evaluation function of a leaf position.|
Leaf positions are supposed to be quiescent; no checks or captures or promotions (or a few other big types of moves). These operations are part of the evaluation function from a programming POV. Search depth refers to the depth before the quiescent postion.
I have always thought that grandmasters (ok Capablanca and a few others) see effectively infinitely far. They do not always look for long forcing lines, but rather look how to rearrange their pieces (and those of their opponent) to achieve a goal.
|Mar-10-17|| ||Howard: Uhhh...hasn't this game been GOTD before ? I'm almost sure it has.|
If so, then why is it being "recycled" into another GOTD?
|Mar-10-17|| ||RandomVisitor: <Howard>Some games like this one are destined to be GOTD again and again in the future...|
|Mar-10-17|| ||tamar: Maybe the GOTD GOAT?|
|Mar-10-17|| ||RandomVisitor: After the suggested improvement 14.Rad1:
click for larger view
Komodo-10.1-64bit: <19 hours computer time>
<-0.22/44 14...Qc8 15.Bd6> Nd3 16.Nxd5 Nxd5 17.Bxd5 Rd8 18.Bxa8 Qxa8 19.Ba3 Bf6 20.e4 Qxe4 21.Qe3 Qc6 22.Be7 Re8 23.Rxd3 Bxe7 24.Nd4 Qd7 25.Re1 Bxd3 26.Qxd3 Rd8 27.Qc4 Bc5 28.Nf3 a5 29.Kg2 Kg7 30.Qe4 Bb4 31.Re2 f6 32.Qe6 Qxe6 33.Rxe6 Bc5 34.Re2 Kf7 35.Nd2 Bb4 36.Nc4 b5 37.Ne3 Bc5 38.Rc2 Bb6 39.Kf3 Rd6 40.Ke4 Ke6 41.f4 Kf7 42.Kf3 Re6
-0.21/44 14...Qd7 15.Qc2 Rac8 16.Qb1 Qf5 17.Qxf5 gxf5 18.Rd2 Ne4 19.Nxe4 dxe4 20.Rfd1 Bf8 21.Bxf8 Bxe2 22.Rxe2 Kxf8 23.Red2 Kg7 24.h4 Re6 25.Kh1 Rec6 26.Bh3 Kg6 27.Bf1 Rc2 28.Kg2 Kf6 29.Ba6 R8c3 30.Rd6+ Kg7 31.R6d5 Rc5 32.R1d2 Kf6 33.Be2 Rxd2 34.Rxd2 Rc3 35.Bb5 Rc1 36.b4 Ke6 37.a4 Nf3 38.Rd8 Rb1 39.Be2 Rg1+ 40.Kh3 Rh1+ 41.Kg2 Rh2+ 42.Kf1
0.00/44 14...Rc8 15.Nxd5 Nxd5 16.Bxd5 Qc7 17.Rc1 Qd7 18.Rxc8 Rxc8 19.Rd1 Rd8 20.Kg2 Bd3 21.Nc3 Bf5 22.f3 Rc8 23.Ne4 Bh3+ 24.Kf2 Nxf3 25.Kxf3 Qf5+ 26.Ke2 Bg4+ 27.Ke1 Bxd1 28.Qxd1 Bc3+ 29.Nxc3 Rxc3 30.Bf3 Rd3 31.Qc1 Qxf3 32.Qc8+ Kg7 33.Qf8+ Kf6 34.Qe7+ Kg7 35.Qf8+
|Mar-10-17|| ||Petrosianic: <RandomVisitor: After the suggested improvement 14.Rad1:>|
What are you saying?
|Mar-10-17|| ||RandomVisitor: Fisher seemed to think that after 14.Rad1 he still had an advantage. It seems that black might have a small advantage.|
|Mar-11-17|| ||morfishine: Fischer's comment "...with mate to follow shortly" isn't perfectly accurate. Yes, Black has a forced win, gobbling up huge amounts of material, but White can hang around awhile after 22.Qf2 Qh3+ 23.Kg1 Re1+ 24.Rxe1 Bxd4 <25.Ne4>|
click for larger view
With the h1-a8 diagonal blocked and White threatening 26.Qxd4, Black must exchange down starting with 25...Bxf2+ winning
A strikingly powerful and beautiful combination
|Mar-14-17|| ||maxi: <sudoplatov> I have missed your comment until now. I assume it is related to what <AylerKupp> and I were discussing back then. It is a good idea to cite some of the people in the discussion, to make the contribution easier to find, just as I have done with your name and AylerKupp's.|
Would you care to explain a bit more to a layman what you mean by "The alpha-beta always returns the value of the game tree that a full search would (it's provable)."
|Mar-19-17|| ||AylerKupp: <sudoplatov> I also missed your comment until now which, depending on your perspective, it might be better if you <don't> mention other user names in your post (at least mine) since that makes it harder for me to respond and therefore it saves you the agony of possibly looking at my posts. :-)|
But, since it's too late now, let me elaborate as to why I said that increasing search depth entails a narrowing of the search trees. A the search depth increases the width of the search tree also increases as more nodes are defined for the leaves of the previous ply. But the number of branches that are considered by the engine is roughly constant and limited by the engine according to what its search heuristics indicate are the most promising branches to expand. So the ratio of actual branches examined to the number of possible branches (which increases exponential) get smaller at each ply. That's what allows engines to search to deep plies in a reasonable amount of time.
And, since so far you haven't responded to <maxi>'s question about alpha-beta (pruning), allow me to try, although of course you can correct me if I'm wrong.
<maxi> Alpha-beta pruning is an improvement over the basic minimax evaluation used by, as far as I know, all the chess engines. Its advantage lies in ordering the search tree so that the most promising tree branches (the ones with the highest evaluation of their leaf node in the minimax sense) are searched first. This is called optimal ordering. If that is done then, if a branch of the tree results in a lower leaf node evaluation than one of the most promising branches, it does not need to be considered further. This results, on the average, in the reduction of about 1/2 of the calculations needed to reach a particular search depth, allowing either the reaching of that search depth in a smaller amount of time or the reaching of a greater search depth in the same amount of time.
What makes alpha-beta pruning particularly effective is that it can be shown (you can find many instances on the web) that the search of search tree with alpha-beta pruning will yield the same results (the Principal Variation and sub-variations) as the search of a search tree without alpha-beta pruning, provided that the move ordering is optimal. For that reason, FWIW, I consider alpha-beta pruning to be an algorithm rather than a heuristic.
As an aside, the need for optimal ordering to achieve best alpha-beta pruning results has a great significance in the non-determinism of multi-core chess engines (two analyses of the same position, on the same computer, by the same engine, conducted to the same depth, will yield different results). This is because the searches are performed by different threads executing in different cores and, as each of those threads are interrupted by higher priority systems processes), they complete their search at different time, the move ordering is modified, and this leads to different results from analysis to analysis.
|Mar-21-17|| ||Petrosianic: You know, speaking of Fred Reinfeld again, there's a position I saw in an old Reinfeld book years ago with a motif very similar to the Re1 line that wasn't played in this game. In both games, there's a Rook to the Back Rank motif intended to remove the protection from a checkmate on KN2. And the kicker is that THIS move wasn't actually played either.|
Fred gave this position:
click for larger view
The winning line is 1. Bxf7+ Kxf7 2. Rf1+ Kg8 3. Rf8+ Rxf8 4. Qg7++.
According to Fred, this line wasn't played because White resigned over the fact that his Queen was pinned to his King and he didn't see how to get out of it.
The annoying part is that Fred would often use examples from real GM games in his books (I remember seeing a Rosanes-Anderssen game in one), WITHOUT telling you who the players were. So, although he tells you White resigned in a winning position here, he doesn't tell you who White was, when the game was played, or anything that might help you identify it. It could be two GM's, or it could be an offhand game he saw in a club. I'd love to see the entire score to this one.
|Mar-27-17|| ||maxi: <AylerKupp>, thanks for the explanation on alpha-beta pruning. I find your posts always very interesting.|
|Mar-27-17|| ||maxi: You are right, <Petrosianic>. I remember having similar doubts. But my first two chess books were A Chess Course (or something like that) by Reinfeld and Capa's Chess Fundamentals! Sometimes Capablanca too would put a chess diagram and not quote the source game. I figured people just didn't write down what the original games were!|
Later I realized Capa would do that with positions from his own games.
|Mar-27-17|| ||sudoplatov: A couple of points about alpha-beta. Given a minimax search tree to a fixed depth, alpha-beta will return the same value (not necessarily the same move) as a complete search. The algorithm works by noting that both sides are trying to minimax their play. |
A couple of caveats are in order. The actual speedup depends on move ordering. Always choosing the best move first in a search (the so-called principal variation) helps. In real implementations, the hash table operates more or less independently of the search tree. So the evaluation of a position may not be exactly the same if positions are examined in a different order; mostly this doesn't matter. The alpha beta search is not usually either a depth-first nor a width-first tree search. One does a depth-first to depth 1; then depth-first to depth 2, etc. The early shallow searches help with ordering; filling the hash table, and may find a game-ending move early.
The point of alpha-beta is that nodes that are pruned cannot influence the final score of the root position (assuming that the evaluation function is accurate.) Thus deeper searches always give a better estimate of the actual position.
Another point is that only quiescent positions are considered leaf nodes. In a quiescent position, there are no captures, checks, or pawn promotions.
There are other algorithms (B* is popular) which do forward pruning. So far, in computer chess (as far as I have read) none of these are as effective as alpha-beta; the
|May-01-17|| ||Mithrain: 12 ... e5 shows how well Fischer understood the dynamics of the position (seriously weakening the d5-pawn but gaining a lot of play with his minor pieces).|
< Earlier Kibitzing · PAGE 21 OF 21 ·