Home
Information
Login
Register
Waiting lists
Membership
Hall of fame
Tournaments
Best game
Wikichess
Rating list
Problems
Forum
Links
Help
About
| Install FICGS apps | |
| play chess online |  |
|
Game result (chess) M. LaDuke, 2306 G. Gray, 2285 1/2-1/2 See game 149750 |
Hot news Discussions Files search Social network
Here are 100 results for 1. Nf3 in the games.
Game_150776 Game_150750 Game_150747 Game_150745 Game_150740 Game_150738 Game_150737 Game_150736 Game_150727 Game_150721 Game_150712 Game_150671 Game_150669 Game_150667 Game_150636 Game_150601 Game_150581 Game_150552 Game_150518 Game_150502 Game_150501 Game_150491 Game_150409 Game_150403 Game_150401 Game_150395 Game_150392 Game_150391 Game_150385 Game_150358 Game_150345 Game_150344 Game_150339 Game_150330 Game_150322 Game_150307 Game_150260 Game_150259 Game_150257 Game_150252 Game_150247 Game_150164 Game_150141 Game_150137 Game_150134 Game_150132 Game_150122 Game_150120 Game_150118 Game_150095 Game_150046 Game_150035 Game_150033 Game_150031 Game_150020 Game_150001 Game_149993 Game_149991 Game_149979 Game_149965 Game_149961 Game_149950 Game_149930 Game_149922 Game_149920 Game_149912 Game_149816 Game_149814 Game_149806 Game_149796 Game_149790 Game_149750 Game_149745 Game_149719 Game_149685 Game_149679 Game_149672 Game_149670 Game_149605 Game_149561 Game_149518 Game_149512 Game_149503 Game_149499 Game_149497 Game_149491 Game_149406 Game_149360 Game_149336 Game_149323 Game_149320 Game_149317 Game_149310 Game_149299 Game_149294 Game_149289 Game_149276 Game_149243 Game_149239 Game_149231
There are at least 7 results for 1. Nf3 in the forum.
Fred de la Foret (2019-02-23 20:12:55)
Best Opening Move?
The English ( 1. c4 ) is considered less popular as best opening move to 1. Nf3, though the English is played by many OTB Masters.
Attila Ba (2013-05-15 17:41:52)
Deep analysis - can it be improved?
The idea behind deep analysis is to store engine evaluations of chess positions in a permanent way and build an analysis tree out of them. Deep analysis is an improvement over simple engine analysis in two ways:
1) Permanent storage of analysis results makes them reusable. You don't have to analyse the same position from scratch over and over again (which is a waste of valuable CPU resources) rather you can build and improve upon your earlier results.
2) The search is configurable. You have control over which positions are examined and in what way. This gives you freedom to tailor the analyis to your own needs not having to rely on the defaults provided by your engine.
This idea is presented in a revolutionary way in the Deep Rybka Aquarium GUI. However using this framework I have encountered some problems. The lesser one and non lethal one is that draws by repetition are not handled correctly. This is for a reason: moves in the transposition table should be valued in an absolute way (regardless of the line which lead to them) in order to preserve the integrity of the tree. Since Aquarium has no means to incorporate lines, it simply ignores them
My other problem is that though the search is configurable I'm not absolutely certain about what is going on. It is not entirely clear to me exactly which nodes are selected for analysis.
These problems made me to try to come up with a deep analyis program of my own. After several failed attempts finally I have on my hand a solution which is not only capable of performing deep analysis but overcomes some of the difficulties of Interactive Deep Analyis (IDeA) provided by the Aquarium framework.
First I introduced a mechanism that can handle repetitions. In order to achieve this I attribute not one but two scores to each move and re-define the concept of root position already present in IdeA. The first score which I call 'idea' score is the same as presented in IdeA. The second is what I call 'alpha' score is calculated by minimaxing the tree from the root position taking into account repetitions.
Consider the following game:
1. Nf3 Nf6 2. Ng1 Nf8
The value of move 2. ... Nf8 at depth 18 by Houdini 3.0 is -19 centipawns. So the idea score of this move at depth 0 should be -19. Yet 2. ... Nf8 repeats the starting position. Therefore its alpha score with respect to a root equaling the starting position should be 0 centipawn which is exactly what my program calculates for it. ( For the sake of simplicity I don't require threefold repetition, since you would never allow your opponent to repeat a position if you have better ideas. )
So when my programs lists the tree it will present both scores for every move (which in most of the cases are equal of course - therefore this is mostly an aesthetic improvement rather than being a substantial one).
The improvement which I'm most interested in is that having full control of node selection now I have freedom to shape the tree search.
In order to keeps things simple I have only three parameters characterising the search:
1) engine depth
2) move distance (centipawns)
3) search depth
Engine depth means a fixed depth at which each move is analyzed. After long experimenting I have arrived at depth 18 as a good default for Houdini 3.0.
Move distance is a tolerance up to which moves are allowed into the analyis. For each position first the best move is determined. The search for alternative moves is continued until a move is found that has a valuation less than the valuation of the best move by 'move distance' centipawns (it is this 'distance' away from being the best move). The tree is then expanded for moves within 'move distance'.
To compensate for exponential growth of analyzed nodes I use a simple technique: at each ply after ply 1 the move distance is halved. So if the move distance at ply 0 and ply 1 is 20 centipawns, it will be 10 centipawns for ply 2, 5 centipawns for ply 3 and so on. This means that at greater depth less and less moves are allowed per position. So the analysis with greater depth slowly evolves into 'autoplay' rather than 'tree search'.
The other method to reduce exponential growth is the well known beta cut provided by alphabeta search. In order that all candidate moves in the root position and all candidate responses to them get proper values, I only allow beta cuts with ply 2 and deeper.
Once an alphabeta search of certain depth is carried out, the whole tree is mimimaxed out for the root. Now the initial evaluations of the root moves may change. This may make moves which initially fall out of the 'move distance' to become viable. So the search has to be repeated for those moves as well. This has to be done at every ply level.
My iterative search at a certain depth only ends when no new nodes are added by the alphabeta search (the tree is 'settled' for this depth). Only then the program is allowed to deepen the search (this I call 'refined' search).
With engine depth of 18 and move distance of 10 centipawns an average position can be analyzed to depth 10 within a matter of hours. This means a couple of hundred (possibly a couple of thousand) positions are analyzed to depth 18. Depth 10 deep analyis means an ultimate depth of 28 if you take into account that the engine depth is 18.
Whether this method has added ELO value over simple engine search is yet to be tested.
Rolf Staggat (2010-07-06 11:47:51)
Encyclopedia of gambits
1. Nf3 ..... 2. Rg1 (later g4)
DIE AMPEL (the traffic-light). Special variation of a german club called Schachfreunde Schöneck.
Discover its possibilities !
Nick Burrows (2009-08-03 01:59:03)
Great game
This game is great!!
R Fontaine (2567)
Vachier Lagrave M. (2595)
French Championships (10)
Aix-les-Bains FRA, 2007
[Edit : see Help section to insert a chess game in the forum]
Hannes Rada (2009-06-16 22:10:24)
Hypermodern
I would not consider 1. Nf3 as hypermodern (whatever this is :-)),
as it will mostly convert into such orthodox openings like Queens Gambit, Queens Indian, ....
Hannes Rada (2009-06-03 22:28:52)
Openings very important for corr chess ?
Well about 3 weeks ago I had a discussion with Austrian's only ICCF world champion.
And he told me that in his next world championship final he is going to chance his opening repertoire completely. Instead of 1. e4 which he prefered so far, he is now going to play another move (1.d4 most probably), because after years of studying chess his conclusion is now that 1.e4 is the weakest choice (compared to 1. d4, 1. Nf3, ...)
The same 'ideology' was also published by former ICCF World Champion Hans Berliner in his book "My System".
.
Dead Endgames: This is another interesting topic to be discussed ....
Peter Unger (2008-09-08 00:54:05)
a game ended with mate
my Game vs. Sharma ended with Mate. Why isn't it finished? And tournament-table isn't adapted?! Here is the game: [Event "FICGS__CHESS__WCH_STAGE_1_GROUP_04__000005"] [Site "FICGS"] [Date "2008.07.08"] [Round "1"] [White "Sharma,Kirti"] [Black "Unger,Peter"] [Result "*"] [WhiteElo "1365"] [BlackElo "2187"] 1. e4 c5 2. Nf3 d6 3. c3 Nf6 4. Qc2 Qc7 5. Be2 e5 6. O-O Be7 7. Na3 O-O 8. Nc4 Be6 9. Ng5 Bd7 10. Ne3 h6 11. Nf3 Be6 12. c4 b6 13. Nd5 Qb7 14. Qd3 a5 15. a4 Nc6 16. Qc2 Nb4 17. Nxb4 axb4 18. d3 Nd7 19. b3 Nb8 20. h3 Nc6 21. Qd1 f5 22. Nd2 fxe4 23. dxe4 Nd4 24. Bg4 Bxg4 25. Qxg4 Bg5 26. Rb1 Rf6 27. h4 Rf4 28. Qd1 Rxh4 29. g3 Bxd2 30. Bxd2 Qxe4 31. gxh4 Ne2+ 32. Kh2 Qxh4+ 33. Kg2 Qg4+ 34. Kh2 Rf8 35. f3 Qg3+ 36. Kh1 Qh3+ 37.* regards retep1
There are 1 results for 1. Nf3 in wikichess.
Thibault de Vassal (2407)
Nf3
The Réti Opening (also called the King's Knight Opening) is a chess opening characterized by the opening move 1.Nf3
It is named after Richard Réti, a Czechoslovakian chess player who used it to defeat the world champion José Raúl Capablanca in 1924.
According to ChessBase, out of the twenty possible opening moves, 1.Nf3 ranks third in popularity. It develops the knight to a good square and prepares for a quick castling. White maintains flexibility by not committing to a particular central pawn structure, while waiting to see what Black will do. The slight drawback to the move is that it blocks the f-pawn. This is not a problem if White does not intend to move it in the near future, but it rules out the possibility of playing systems with f3 and Nge2, which is a fairly popular setup against the King's Indian.
Usually 1.Nf3 will transpose into an opening with 1.d4, such as the King's Indian or the Queen's Gambit. If White follows up with an early c4 a transposition to the English Opening may be reached. Even the Sicilian Defense may be reached if the game opens 1.Nf3 c5 2.e4.
According to Chessbase, white chances are about 57%
============
Contributors : Thibault de Vassal
[Chess forum]
[Rating lists]
[Countries]
[Chess openings]
[Legal informations]
[Contact]
[Social network] [Hot news] [Discussions] [Seo forums] [Meet people] [Directory]
[Social network] [Hot news] [Discussions] [Seo forums] [Meet people] [Directory]
Social network : create your photo albums, discuss with your friends...
Hot news & buzz : discover the latest news and buzz on the internet...
Discussions : questions and answers, forums on almost everything...
Seo forums : search engines optimisation forums, web directory...
Play the strongest international correspondence chess players !
|
Marciz, Alexander (RUS) [member # 11810] Correspondence chess : 2501 FIM Ranked # 26 in the rating list. Rating history : No change this year. Advanced chess : 2332 Bestlogik - 2360. LSS - 2445.chess-land.com/ -1805.  This member has no profile in the social network. |
 | Correspondence chess World championship Play chess games Go (weiqi, baduk) Advanced chess Play big chess Chess trainer apk Rated tournaments Poker texas hold'em Fischer random chess |  |