For posting: - invitations to games (you can also use the New Game menu or go straight to the Chess Invitation) - information about upcoming tournaments - discussion of games (please limit this to completed games or discussion on how a game has arrived at a certain position ... speculation on who has an advantage or the benefits of potential moves is not permitted) - links to interesting related sites (non-promotional)
For all of you who think you can lob such general comments as "this was a computer game", let me point out a few things.
1. Since so many people were making snide comments about the Double Muzio game posted on here, where there is a sacrifice of first a knight and then a bishop, I decided I would go after Alex and try to win a game using the same theme: offering the sacrifice of a knight and bishop, just to emphasize the point. I mentioned this to ChessCarpenter long ago.
We can go back all the way to a Reshevsky game where the pawn push c4 is played (although much earlier in the game) to give white the slight edge in the opening. I studied the game, and elected not to do so, since a well timed ...d5 by black will equalize in the early stages and actually convey a slight advantage by the onset of the middlegame. So, the hunt was on not just for a "substitute move" but a new plan.
At this point in the game, move 11, I decided to play a non-traditional, strategic move, for the sole purpose of securing the queenside pawn structure (making it virtually bullet proof) and then tasking the knight to go on a long trip from the queenside to the kingside via d2 instead of c3.
Inspiration came from the King's Indian Attack, another opening I like when playing as white. Three consecutive Knight moves get the Knight into position, and I thought at this point "clearly black sees what I am doing here", so I thought I would "give away" my plan.
4. white gives up a piece that is never recovered again, something computers usually do not do.
I would like all of you "computer experts" to tell me, how long would it take a program to search 33 plies from move 10 of the game? 1 day? 3 days? 10 days? How about 2 to the 12th days if there is a branching factor of 2 and you can complete a 21 ply search in 1 day.
4097 days of search would be required to play this line with a program starting from move 10.
(Cacher) Si vous avez besoin de trouver un ancien message d'un utilisateur en particulier, cliquez sur son Profil et utilisez le lien "montrer les messages de cet utilisateur" en haut de la page. (konec) (Montrer toutes les astuces)