The next value is the success rate, given from White's perspective The remaining values are the probabilities that the results will fall within the indicated ranges.
You can let Monte Carlo analysis run for as long as you like. Remember that the more games you let the engine play, the more reliable will be the statistical results. Let's take a last look at the statistical Monte Carlo analysis for our game Didier-Janowski after White's In fact, Black won just seven out of games played from this position.
What Rybka's Monte Carlo analysis is telling us is that Rxb6 is a crappy move, but that Janowski was practically forced to play it since his alternatives were actually worse so Janowski essentially painted himself into a corner somewhere along the way prior to this point. But the interesting thing is that Janowski went on to win this game; you can do a database search to find it and play out the rest of the moves if you like.
Back to Rybka: to stop the Monte Carlo analysis, click the "Stop" button the little red button with the white "x" in the upper left corner of the Monte Carlo analysis screen. You'll see a popup dialogue asking if you wish to save the tree which the analysis generated. If you click "Yes", you'll get the standard Windows dialogue prompting you to pick a folder in which to store it and for you to give it a name. Note that all of the game moves prior to the point at which you started the analysis are also saved as part of the tree; in our example, all of the moves through All of that seems prety verbose, but it's really very simple: Monte Carlo analysis causes Rybka to play a large number of games against itself and then store the results in the form of a statistical tree.
That's really not hard to understand at all. OK, friends, strap yourself in for this one, because it's a pretty brilliant idea. In fact, it's one of those "obvious" brilliant ones, the kind where you smack yourself in the forehead and say, "Why didn't I think of that?? Rybka has a new analysis mode called "Shared Analysis". Basically it involves a pair of "twin" chess engines analyzing simultaneously. This is nothing new; an old 's chess program used this technique to offer "instant" game analysis as soon as you finished a game against it.
But Rybka's Shared Analysis feature offers an interesting twist on this old idea. Before we proceed, we need to do a quick review on the subject of hash tables. When a chess engine looks ahead at the myriad possibilities which lie ahead, it stores the positions it's already evaluated and their numerical assesments in the hash tables. Then, if elsewhere in its search, it encounters the same position again due to a different move order, known as a transposition it won't waste time evaluating that position a second time - it just uses the stored evaluation from when it previously analyzed that position.
Shared Analysis is used when analyzing a single position. Then right-click in the Engine Analysis pane to get a popup menu and select "Shared Analysis" from that menu. You'll see the analysis pane change to resemble the following:. The single Engine analysis pane then splits into two panes. Here's what's happened. The original chess engine shown in the upper pane in the illustration above gives up half of your computer's processor cycles.
The software then starts a second "invocation" of the same chess engine which will then use that freed processing power; in other words, the software starts an identical copy of that same chess engine.
Both of these engines then start analyzing the position, each using half of the computer processor's power. The first chess engine gets "locked" on the initial position it was analyzing when you started Shared Analysis. But the second chess engine in the lower pane, noted as the "B" engine in the above illustration is free to analyze different positions if you move the Notation pane cursor somewhere farther ahead in the game, but this second engine will also be storing its analyses in the same hash tables which it shares with the "A" engine.
OK, give up? Let's start Shared Analysis and then use the cursor keys or VCR buttons to jump the game ahead, say, three moves. The "A" engine will still be analyzing the initial position the one on the board when we started the Shared Analysis function , but the "B" engine will be analyzing the position on the board three moves later and storing its evaluations in the hash tables it shares with Engine "A"; in theory, the "B" engine will always be three moves ahead of its "twin", therefore it'll always be storing positions in the hash tables for places the "A" engine hasn't reached yet.
But when the "A" engine does get to these points, it'll find a whole lot of positions which have already been analyzed. This will allow the "A" engine to analyze a lot more positions very quickly and search even deeper than it could if the "A" engine was analyzing by itself.
It's like a military team sending a reconaissance patrol ahead to report back on the terrain and enemy positions it encounters. When it's all said and done, Engine B is "feeding" extra analysis to Engine A:. You can see in the above illustration that the "A" engine is still analyzing the initial position after Black's 15th move and is also displaying the analysis in a bold font to remind us that this is the main analysis.
But we've jumped ahead three moves in the gamescore as we can see by looking at the "B" engine's Analysis pane; that Rybka engine is looking ahead from Black's 18th move. It's storing those positions in the same hash table files that the "A" engine is using, so when the "A" engine encounters these positions it won't have to analyze them - it'll already have access to these evaluations. To exit Shared Analysis mode, right-click on the "B" engine and select "Close" from the popup menu.
That's not just brilliant, that's crazy brilliant. But it's also one of those forehead-smacking genius ideas that's almost too obvious, now that someone's actually implemented it.
As a last tip regarding Shared Analysis, it's best used with a large-sized hash table as big as you can get without causing excessive hard disk activity.
Remember, you set the hash table size in the engine selection dialogue reached by hitting F3 while in the main chessboard screen. When it comes to computer chess, GMs in my experience tend to be an interesting blend of ignorance about technical issues and some pretty savvy insight about where each program is not reliable. Anyway, being more tactically aware has been one major area of focus for me for the past few years.
As for the opening book — Jiri Dufek is the author of the Rybka 4 opening book. He's been using Lukas' cluster to analyze and test and this book is much deeper and more accurate than every book which is publicly available right now.
Note however that this book will be 'objective' — Jiri's goal has been to find the truth, rather than to find variations which suit Rybka.
This is an intentional decision by our team. Our goal is to create objective analysis tools. This is what users want, and it also simplifies Jiri's life somewhat, as he doesn't have to worry about things like how Rybka is evolving. Knowledge guides the search — Rybka searches those things which her heuristics tell her are important.
Do the pieces have always fixed material values or do they change with placement or influence on the given position? Does e. If yes, how large is it? There are no real restrictions on Rybka's heuristics and how they are formulated, they are interrelated in whatever way I think is best. Many heuristics involve combinations of many features and they can become quite elaborate over time.
If I think a heuristic will work, I try it, and if it works I keep it. The bishop pair is of course a major item, there are all sorts of heuristics related to it. On average, the bishop pair seems to be worth around half a pawn. The exact value depends on things like whether the position is open or closed, how many pieces are still on the board, and how many minor pieces the opponent has.
Bishop pairs like an open board, and they don't like opposing minor pieces. None of this is any secret, any grandmaster or FIDE master, for that matter could tell you this. Yes, of course, but the transition is smooth.
Abrupt transitions are very difficult, to formulate and to maintain later — they tend to create unexpected problems. Situations where abrupt transitions are appropriate are difficult for computers. There is some, but I try to avoid really special cases. I look for heuristics which trigger in let's say at least one position out of a thousand, or something like that. Of course, the problem is that endgames are full of special cases.
This area needs a lot more work. Does it help to use endgame tablebases? If not, when should they be used when analysing endgames?
Sure, tablebases help. Rybka will misevaluate a lot of tablebase positions without them. I think it's best to always use them — there is no reason not to. They are sometimes probed even when analyzing middlegame positions. Does Rybka evaluate and handle rook endings well or does Rybka often underestimate the drawish tendency? For the next two or three years, I'm planning to concentrate on playing strength. This is still the most important issue right now.
High Elos nonwithstanding, Rybka is still too blind in too many positions. Together with ChessBase and other publishers, we'll also add various simple analysis features during this time. Our main criteria for analysis features right now is that they should be intuitive, non-intrusive, and frequently visible. Most users tend to have very little patience for hidden features which require a steep learning curve, and even less patience when those features make other tasks more difficult.
Vas Rajlich with his wife Iweta in Budapest, where the two lived for some years. After that, we will concentrate on real chess training.
We will try to find better ways to communicate the chess knowledge from the engine to the user. A computer program should be just as good at training a human as it is at playing a tournament game. Of course, computer training will always have its relative strengths and weaknesses — a computer program has graphical capabilities which no human trainer can match, while linguistic expression will probably be awkward for machines for a long time to come.
There are of course also areas for example, the psychology of practical play which are relatively difficult for a computer to understand. The first load of Rybka 4 arriving at the ChessBase office in Hamburg. Nxd4 Nf6 5. Nc3 a6 6. Be3 e6 7. Qd2 Nbd7 9. Bxc4 bxc4 O-O And now However, in recent months black's life has not been so simple. Here is another source of worry for black. Nd2 Nf6 4. Bd3 c5 6.
Ne2 cxd4 8. O-O Bd6 Nf3 Qb6 Bf4 Bxf4 Nxf4 O-O Qd2 g6 C Ruy Lopez. Jaenisch Gambit The Rybka Aquarium book includes a full coverage of the Jaenisch Gambit - everything is engine-checked and I made a lot of new analysis to support this interesting opening.
Here are some "normal" remember that this is the Jaenisch! Zaitsev Variation From time to time I tested my book on Playchess. I was surprised, when I found the following line to be very popular.
Nf3 Nc6 3. Bb5 a6 4. Ba4 Nf6 5. O-O Be7 6. Re1 b5 7. Bb3 d6 8. Nbd2 Bf8 Bc2 exd4 Bb1 c5 Ra3 Nb6 Nf1 f5! When I first saw this method of playing, I felt that there had to be a simple countermeasure. I think that I succeeded in finding a simple solution, although finding it took more time and effort than I had expected.
Nh2 in the book. D Queen's Gambit Accepted The Queen's Gambit Accepted is very popular nowadays, and often white players choose strange sidelines, because the mainline is holding for black.
This is not true after: 1. Nf3 Nf6 4. Bxc4 c5 6. O-O a6 7. Bb3 b5 8. Nbd2 Nxd2 Bxd2 cxd4 Ng5 Be7 Qh5 Bxg5 Bxg5 Qd7 Here white has the subtle move The theoretical debate is very, very deep and it looks like it will soon end in a simple endgame. The Rybka Aquarium Book includes the latest development of this line. After the moves 1. Nc3 e6 5. Bg5 dxc4 6. Bh4 g5 9. Nxg5 hxg5 Bxg5 Nbd7 Bg2 Qb6 O-O c5 Na4 Qb5 Qg4 Bxd5 Rfc1 Nc6 Bxd5 Rxd5 Rxc4 Rxg5 Qd4 Kb8 Rd1 Qc7 Kf1 Rh5 Rxd5 exd5 Ke4 Bd6 , your engine will probably show something around 0.
Many theoreticians have liked the system with Be5-c7-a5. However, in the recent months black has faced a lot of trouble here. I did my best to revitalize this line. Nf3 c5 8. Rb1 O-O 9. Be2 Nc6 Nxe5 Bxe5 Qd2 e6 O-O exd Ba3 Bf5 Rbc1 Rc8 Bf3 Qd7 Rcd1 Rfe8 Rxe1 Bd8 Bb2 24…c4! One of the key positions arises after the moves 1. Nf3 Bg7 5. Qb3 dxc4 6. Qxc4 O-O 7. Qb3 Nfd7 Qd1 Nb6 Be3 Bf5 Ng5 Rf6 Nce4 Bd5 However, white now has a devastating continuation.
Nb4 The Rybka Aquarium book contains many ideas and novelties in this opening, one of them being 1. Bg2 c6 6. Bd2 Qxd4 8. Bxb4 Qxe5 9. Na3 b5 Bd6 Qxb2 O-O Nd5 Qh5 Nd7 Qg5 f6 Rae1 with attack. E Queen's Indian Defence, Petrosian Variation The old Petrosian recipe for handling the Queen's Indian Defence is not popular nowadays, but from time to time black tries too hard to win against this solid system and risks too much.
This is line is an example: 1. Nf3 b6 4. Nc3 Ne4 6. Nxe4 Bxe4 7. Nd2 Bb7 8. Nf3 Qg6 Be2 Be7 O-O Bf6 After Bd3 Bxa1 Bxe4 dxe4 Bf4 The following installation instructions are from the column one month later Installation The Rybka 4 Aquarium Opening Book uses a standard Windows setup program to install the book. If you bought the download version, you must start by downloading the setup program about 1.
As always when installing updates or new features, you should exit Aquarium before starting the installation. When the download is complete, double-click the downloaded file to start the installation. While the setup program is running, it shows you where it is installing the opening book. The installation path is highlighted in the image above.
Viewing the Opening Book Once the installation is finished, start Aquarium and switch to the Sandbox. Select the Tree tab in the ribbon and click the leftmost button to display a list of available tree configurations. The opening book contains thirteen columns of data. Some of them are only of interest to those who will use it for playing chess engine games, but most of the columns are intended for chess players who are studying the opening.
I will describe each column in detail. There is one new feature for displaying trees in Aquarium 4 that is used in the Rybka 4 Aquarium Opening Book. Several columns in the tree window can now be grouped under a single heading. The next screenshot shows an example where the three columns based on the Hugebase database are displayed under a single heading.
0コメント