|
< Earlier Kibitzing · PAGE 7 OF 7 ·
Later Kibitzing > |
| Mar-22-08 |
| Wone Jone: Are we there yet? |
 |
May-03-08
 |
| deadlysin: i think this made them have sore hands |
 |
| Jul-04-08 |
| Ryan Razo: Arsovic is just incredibly stubborn... |
 |
| Dec-01-08 |
| WhiteRook48: <jon01> This is not the longest game ever. Look at the chess games of Hiraku Nakamura. He has Rybka vs Nakamura, 271 moves, as one of his games. |
 |
| Dec-02-08 |
| WhiteRook48: loooooooooooooooooooooooong |
 |
| Dec-17-08 |
| WhiteRook48: You should see the misfortune of the c7-Pawn. First he captures a d6 Pawn, then over 70 moves later, he marches to d5 and dies on the same square after about 30 moves. |
 |
| Dec-18-08 |
| WhiteRook48: The Ra1 and the Ra8 at the start are the Rooks that survive the game. As does the two Kings (they never leave the board, do they?) and the Bf1 stay on the board until the end. |
 |
| Dec-23-08 |
| WhiteRook48: ha ha ha ha ha what a looooong game. I bet these hands were tired from moving pieces for so long |
 |
| Dec-27-08 |
| gauer: <horror, RandomVisitor, makaveli52> the result of the latter's <makaveli52 claims plies = 6518>, together with a task by N. Petrovic, Fairy Chess Review, 1946 [ http://en.wikipedia.org/wiki/World_... ] claims a position of tries = 218 = 2*109 max. moves for a side at one possible position given. click for larger viewTherefore, the max. # of positions in chess < (tries)^(plies) = (2^6518)*(109^6518). The starting array position has merely 20 choices, definitely less than 218 available, making the inequality strict. Not sure whether this is a more efficient calculation or a similar calculation than to take mere random combinations of scattering of pieces across empty squares or not. |
 |
| Dec-30-08 |
| WhiteRook48: how did all those queens get there??? |
 |
| Jan-11-09 |
| WhiteRook48: someone should annotate this game |
 |
| Jan-13-09 |
| WhiteRook48: and check it for blunders.
Arsovic made blunders, too, but I can get a Nikolic one right away-
201. Rg7 but white was probably tired. |
 |
| Jan-16-09 |
| WhiteRook48: this was a draw for a long time. |
 |
| Jan-21-09 |
| WhiteRook48: check out moves 82-84. Looked kind of like a Bishop and Rook tipsy dance (whatever THAT is.) |
 |
| Jan-28-09 |
| WhiteRook48: man, I can't even believe these guys played for SOOOOOOOOOOO long |
 |
| Jan-31-09 |
| WhiteRook48: did white also miss a win on move 255? |
 |
| Feb-06-09 |
| WhiteRook48: great draw, although at least they fought on instead of Janosevic-Geller |
 |
| Feb-08-09 |
| WhiteRook48: let's make it game of the day |
 |
| Feb-15-09 |
| WhiteRook48: Again, I hear white missed a win on move 255. What should he have played instead of 255. Kc5 if I didn't hear wrong? |
 |
| Mar-24-09 |
| WhiteRook48: from Opening Explorer
11. Nd2 is best |
 |
May-19-09
 |
| David2009: <Feb-15-09 WhiteRook48: Again, I hear white missed a win on move 255.>  click for larger view Amazingly, 255 Rh2-h3 wins. Black's last move had been Ka5-a4: Kb6 instead escaped e.g. Rb2+ Kc7. |
 |
| Aug-01-09 |
| I Like Fish: that is...
just about...
the limit... |
 |
Aug-01-09
 |
| Phony Benoni: I was interested in the position posted earlier by <gauer>:
 click for larger view
Naturally, I was wondering how quickly White could helpmate himself. The answer appears to be four moves: <1.Qeh2 bxc1Q 2.Qfg2 Qxd2 3.Raf8 Qxd7 4.Rf2 Qxd1#> With several similar solutions. Can anybody do it quicker? |
 |
| Aug-13-09 |
| gauer: <Phony Benoni> That's some neat help-mate. Did you notice in the game above that had they played on, one of the sides might've had the chance to visit all 64 squares. Do you know how many which side it was that he missed? |
 |
| Oct-08-09 |
| GrahamClayton: <Knight13>If I were writing this game, my hands will get very very tired for sure. Knight13,
That's what I was thinking - both players would have got Repetitive Strain Injury (RSI) by writing down all of the moves! How many scoresheets would have been needed to write down all the moves for both players? |
 |
 |
|
< Earlier Kibitzing · PAGE 7 OF 7 ·
Later Kibitzing > |