Rybka 3: Single Processor Version Computer Chess World Champion 2009 by The Chess Assistant team
Our Price: $ 64.95
Publisher: ChessBase, 2008
Edition: DVD Language: English
Rybka has won the 17th World Computer Chess Championship, staged by the International Computer Games Association in Pamplona (Spain), the US-Czech program retained it's title, gained in Amsterdam 2007, with a point and a half to spare.
Actually Rybka did win three titles:
the 17th World Computer Chess Championship
the 14th Computer Olympiad (no hardware limit)
the 17th World Computer Chess Championship (Blitz)
Today the main use of chess software is interactive analysis. Rybka's superior playing strength helps you to quickly assess a position. But analysis with Rybka 3 is much more than just evaluations and best moves. In the user interface designed by ChessBase, Rybka 3 introduces several ground-breaking new analysis features:
Monte Carlo Analysis yields precise evaluations by playing thousands of ultra-fast games in a few minutes in a given position. This is very much like using game result statistics, something human players do when choosing their opening variations. Monte Carlo Analysis can be used in any position, but generally it's most useful in two types of positions:
Endgames – engines often give high scores to drawn endgames (and sometimes low scores to winning ones). Monte Carlo recognises fortresses and other no-progress situations. It's also good in rook endgames, which are another computer problem. Positions where one side has made a big material sacrifice for slow compensation (i.e. not just tactics). For instance you can find lots of piece sacrifices in famous grandmaster chess games which no computer will correctly appreciate and which Monte Carlo gets right.
Interesting: in the starting position the Monte Carlo Analysis gives a 52.8% win probability for White
Sampled Search gives detailed information about the search process, showing scores and alternative moves in the main line. This is helpful when the program searches for a long time in one position. It lets the users see how the engine is thinking and making its decisions.
Note that in in the live search you can see that the Rybka engine is working on Kasparov's famous 30.Rxb7 sacrifice, which has not turned up in the engine window yet (it will become the main variation after the next iteration). Note too that the square Chess Informant symbol behind certain moves means that these are forced.
Singular Moves are annotated graphically. This indicates situations where only one clearly best move exists.
Look for win: whenever you feel that there should be a forced win in a position you can explicitly ask for it. Rybka then searches for a decisive move, considerably faster than in normal analysis.
New high-resolution 3D Staunton pieces in Rybka 3
Persistent Hash: Rybka can save its hash tables between analysis sessions to preserve valuable information already accumulated in the search tree.
The author of Rybka, Czech-American International Master Vasik Rajlich, has implemented an extraordinary understanding of dynamic factors into his program.
This often results in long-term pawn or exchange sacrifices and an active positional playing style resembling human chess. Rybka scores well in all types of situations but dominates especially in asymmetric positions which arise e.g. from Sicilian systems.
System requirements: Minimum: Pentium 300 MHz, 64 MB RAM, Windows Vista or XP (SP 2), DVD ROM drive, Windows Media Player 9. Recommended: Pentium IV 2.2 GHz or higher, 256 MB RAM, Windows Vista, GeForce5 or compatible graphics card with 64 MB RAM or higher, 100% DirectX compatible sound card, Windows Media Player 9, DVD ROM drive.
