Members · Prefs · Laboratory · Collections · Openings · Endgames · Sacrifices · History · Search Kibitzing · Kibitzer's Café · Chessforums · Tournament Index · Players · Kibitzing
Nikita Vitiugov vs Jorden van Foreest
"Run, Foreest, Run" (game of the day Feb-06-2021)
Tata Steel Masters (2020), Wijk aan Zee NED, rd 7, Jan-18
French Defense: Classical. Steinitz Variation (C11)  ·  0-1



explore this opening
find similar games 1 more Vitiugov/J van Foreest game
sac: 41...Rxb6 PGN: download | view | print Help: general | java-troubleshooting

TIP: Some people don't like to know the result of the game in advance. This can be done by registering a free account then visiting your preferences page, then checking "Don't show game results".

PGN Viewer:  What is this?
For help with this chess viewer, please see the Olga Chess Viewer Quickstart Guide.


Kibitzer's Corner
Jan-18-20  Whitehat1963: Finally! Someone won with the black pieces!
Jan-18-20  vonKrolock: <Effects of de-Foreest-ation>
Jan-18-20  MordimerChess: That was quite a thriller! Jorden van Forest has definitely great tournament, winning game after another. Here got extra pawn in the opening, another one in the middle game... and also some more at the endgame. But experienced Nikita Vitiugov scared him badly after 37. g4, followed by 38. Rxc5. Impressive come back but not changing the the score. Jorden van Foreest could fall into a drawing trap though. But he managed to bring one point to the end.

My commentary:

Wanted to do short youtube movie today but all these g4/Rxc5 motives got so many lines that I tried to cover... hope it's worth watching!

Jan-18-20  Hokey pokey: Interesting ending!
Jan-19-20  Fanques Fair: How does Black win in the final position after 63-Bb2+ ( not 63-Bxh6, g3+, Re1, 64-g2, Be3, 63-c1=Q+) , Kf4, 64- Bc1+ ?
Premium Chessgames Member
  dernier loup de T: <Fanques Fair>, you should check the numeration of the moves you propose. Anyway, after your Bc1+, Kf5 and Ke5 lead both to mate.
Premium Chessgames Member
  dernier loup de T: <MordimerChess>, thanks a lot for your link. And the discovery of a chess channel where games are commented is always a joy for me! Congratulations and good continuation!
Jan-19-20  MordimerChess: <dernier loup de T> I am really glad that more people like my job. Still struggling with speed, fluency, energy and broken english... but first 24 days passed, managed to produce 20 videos, 60 subscriberes, 1.6k views... thought it's gonna be much worse!

Once Tata Steel Chess 2020 is done, I am coming back to my Akiba Rubinstein series - his life and games. Thanks for good word!

Jan-19-20  Fanques Fair: Dernier , 63-Bc1+, Ke5, 64-Bb2+, I donĀ“t see any mate. After 63..., Kf5, I keep not seeing any mate.
Premium Chessgames Member
  beatgiant: <Fanques Fair> Can't Black simply retreat the king until White runs out of spite checks? 63. Bb2+ Kd6 64. Ba3+ Kc6, and I don't see how White stops the pawn avalanche.
Premium Chessgames Member
  dernier loup de T: <beatgiant>: absolutely! Your idea is the simplest way, and even the shortest!
Premium Chessgames Member
  dernier loup de T: <Fanques Fair>, yes, IT WILL BE mate, grr!! But the best way to proceed is really proposed by <beatgiant>!
Feb-06-21  Brenin: "The passed Pawn has a lust to expand". By the end, those Black c, d, e and g Pawns are massive.
Feb-06-21  goodevans: Stockfish suggests <38.axb6 axb6 39.Rxc5 bxc5 40.b6> as an improvement over what was played, viz. <38.Rxc5 bxc5 39.b6 axb6 40.axb6>.

I find it utterly bizarre that a powerful chess engine can't recognise a simple transition of moves. You'd think that that would be a really useful ability for a chess engine to have in order to cut down the number of branches it has to evaluate.

If no one has the time to proof read these engine annotations before they get posted then what's the point of having them as this sort of mistake just makes them look silly. Personally I'd rather they weren't there at all for the GOTD as they inhibit kibitzers doing and posting their own analysis.

Feb-06-21  RandomVisitor: <goodevans>Transposition detection is a good idea and would seem to be a way to save search time and therefore result in stronger performance.

Unfortunately, no one in the Stockfish community of programmers has currently figured out a way to do it without impacting the overall tournament performance of the program. I have seen improvements in tournaments of thousands of automated games that were a fraction of an ELO point accepted as a modification. But unless it improves overall tournament performance in a performance test of thousands of games, the improvement - however well-intended - gets rejected.

Stay tuned, as this idea has merit and it is likely that where there is a will, there is a way to do it.

For example, this recent modification to the Stockfish code used a 788,000 game tournament to 'fine-tune' a certain internal parameter, then 2 additional tournaments of 32,000 games to confirm a net improvement of less than 2 ELO:

Author: bmc4
Date: Sun Jan 31 16:00:06 2021 +0100
Timestamp: 1612105206

Tune ordering of moves at internal nodes

We change the relative weights of the function used to order quiet moves in our MovePicker class.

Passed STC:
LLR: 2.94 (-2.94,2.94) -0.25,1.25
Total: 32184 W: 2936 L: 2773 D: 26475 Elo +1.76
Ptnml(0-2): 115, 2196, 11328, 2317, 136

Passed LTC:
LLR: 2.93 (-2.94,2.94) 0.25,1.25
Total: 33088 W: 1292 L: 1149 D: 30647 Elo +1.50
Ptnml(0-2): 14, 1030, 14318, 1163, 19

The new weight were chosen after the following SPSA session:


Bench: 4398803

Feb-06-21  RandomVisitor: 43.Bc2 followed by Bd4 might just hold for white:

click for larger view


<83/37 3:25:29 0.00 43.Bc2 Bh5 44.Bd4> Kf7 45.Bd1 Kg6 46.Bc2+

82/24 3:20:37 0.00 43.Bc2 Bh5 44.Bd4 Kf7 45.Bd1 Kg6 46.Bc2+ Kh6 47.Kg2 Bg6 48.Ba4 Kg5 49.Kg3 h5 50.Bxg7 h4+ 51.Kf2 Kf4 52.Bh6+ Ke5 53.Bg7+

Feb-06-21  Cheapo by the Dozen: Good choice!

Imbalanced-endgame games are great GoTD fodder, in my opinion. And the obvious name pun decently fits the game. (A king hunt would have been ideal, but a bunch of pawns running free is a good alternative.)

Premium Chessgames Member
  AylerKupp: <<goodevans> I find it utterly bizarre that a powerful chess engine can't recognize a simple transition of moves. You'd think that that would be a really useful ability for a chess engine to have in order to cut down the number of branches it has to evaluate.

<RandomVisitor>Transposition detection is a good idea and would seem to be a way to save search time and therefore result in stronger performance.

The current hash table provides a mechanism for detecting positions arrived at via move transpositions. But as far as I know it's only used to save time in re-evaluating positions that have already been detected.

In order to use the information available in the hash table for search tree pruning, the hash table structure would have to be modified to provide a pointer to the search tree node associated with the position so that the subsequent moves in that line can be identified. That's pretty straightforward.

But the results may not be directly usable and, if they are, they are likely not going to be as accurate. Any time a position is reached that's in the hash table, that position will likely have occurred at a higher move/ply number. As a result, expansion of the search tree from that point, if the same expansion is used from the ply that the position was initially detected, will not be as deep as if the search tree were expanded with the duplicate position just detected as the root of the search tree. This may or may not be significant depending on the position and probably many other factors.

Besides, because of the chess engines' non-determinism, there is no guarantee that the subtree expanded from the second detected occurrence of the position will be the same as the subtree expanded from original position. And who's to say whether the original or subsequent search tree(s) will be better at identifying the variation developed from the root of that subtree?

Still, even if the expansion of the subtree originating from subsequent detections of the same position, the time savings will likely allow the search tree to be expanded to a deeper depth, possibly improving the accuracy of detecting the principal variation.

Given these conditions, and I suspect that there are others, I have no idea whether making use of the hash table for search tree pruning would increase or decrease the accuracy of the principal variation, nor do I know if it has ever been attempted. I would think that in order to determine its effectiveness that a series of games could be conducted between two versions of the engine, one using the hash table as a means of search tree pruning and one not using it. But, for all I know, this might have already been tried and discarded because it either didn't result in an overall improvement or detriment in the engines' playing.

But it seems to me that it is a technique worth trying. Of course, anything that you don't have to spend any effort doing is a good candidate for trying. :-)

Feb-06-21  goodevans: < RV>, < AK> Many thanks for your interesting responses.

I guess this failure to recognise transpositions would account for those occasions when the engine's optimum line begins with both sides repeating a couple of moves before doing something else. The same position effectively gets analysed to a shorter depth giving a different, sometimes higher, evaluation.

Premium Chessgames Member
  AylerKupp: <goodevans> Surely you know that it's been common for a long time for top players to quickly repeat some moves in order gain time for other moves remaining before the time control. These chess engines are just trying to emulate that; they play more human-like than we think. ;-)

NOTE: Create an account today to post replies and access other powerful features which are available only to registered users. Becoming a member is free, anonymous, and takes less than 1 minute! If you already have a username, then simply login login under your username now to join the discussion.

Please observe our posting guidelines:

  1. No obscene, racist, sexist, or profane language.
  2. No spamming, advertising, duplicate, or gibberish posts.
  3. No vitriolic or systematic personal attacks against other members.
  4. Nothing in violation of United States law.
  5. No cyberstalking or malicious posting of negative or private information (doxing/doxxing) of members.
  6. No trolling.
  7. The use of "sock puppet" accounts to circumvent disciplinary action taken by moderators, create a false impression of consensus or support, or stage conversations, is prohibited.
  8. Do not degrade Chessgames or any of it's staff/volunteers.

Please try to maintain a semblance of civility at all times.

Blow the Whistle

See something that violates our rules? Blow the whistle and inform a moderator.

NOTE: Please keep all discussion on-topic. This forum is for this specific game only. To discuss chess or this site in general, visit the Kibitzer's Café.

Messages posted by Chessgames members do not necessarily represent the views of, its employees, or sponsors.
All moderator actions taken are ultimately at the sole discretion of the administration.

This game is type: CLASSICAL. Please report incorrect or missing information by submitting a correction slip to help us improve the quality of our content.

Featured in the Following Game Collections[what is this?]
French Def: Classical. Steinitz Var (C11) 0-1 Video link
from Video link kibitz put Fredthebear in new century by fredthebear
French Def: Classical. Steinitz Var (C11) 0-1 Video link
from vids frednch collection of Fredthebear by fredthebear
by Miguel Medina
French Def: Classical. Steinitz Var (C11) 0-1 Video link
from Promotions/Attempts, Some Better Than Others by trh6upsz
February 6: Run, Foreest, Run
from Game of the Day 2021 by Phony Benoni
Run, Foreest, Run
from lechacal's pun by lechacal

Home | About | Login | Logout | F.A.Q. | Profile | Preferences | Premium Membership | Kibitzer's Café | Biographer's Bistro | New Kibitzing | Chessforums | Tournament Index | Player Directory | Notable Games | World Chess Championships | Opening Explorer | Guess the Move | Game Collections | ChessBookie Game | Chessgames Challenge | Store | Privacy Notice | Contact Us

Copyright 2001-2023, Chessgames Services LLC