When Boris Spassky was to defend his World Champion title against American Bobby Fischer, it is known that the Soviets took about four months to copy all the items found on the challenger. The issue was very important because not only played world chess title, but that was put in check, literally, the leadership of the Soviet chess game that was a national symbol and that Soviet communism had been flagged as part of cultural revolution. Today, not a chess player needs a group to compile the games of a rival in particular. With databases of items, the managers of these, as 
Chessbase or Chess Assistant
, you can have the largest collection of chess games that can be imagined, which now range between 5 and 6 million events chess. Of course this information virtually condenses all the chess games played since he practiced as we know it (around 1525). 
Chessbase or Chess Assistant Well, at some point as I have already said, I believe I had a moment of true enlightenment
. For a moment I felt I understood how to understand chess and for that I gave myself the task of working on possible tools to help me prove that I was on the right track. Thus was born the program analyzes the patterns of positions, who hopes, somehow, create a position description language, but that somehow takes into account the positions archetypal patterns, which may show a winning combination, where the items are repeated (to what I mean by employers). In these two links, it and other
it, I talked about these ideas.
For some time already seems long, I searched for how to represent typical patterns of chess. The reason for this is that this could be searched for patterns in chess games and so get the relevant information had been given a particular pattern. A student at UNAM told me that it might be good to talk to a mathematician, he thought this was a task for a specialist of this nature. But between do not know who could deal with a description language like that I need, and from what little information on this subject can be found on the net, I've been leaving for a better time. But here I find the Chess Query Language (CQL), a system to search for topics in chess positions. Although this is not strictly the patterns I'm interested, obviously has a strong correlation and that probably is the right way to develop this descriptive language that I speak. The
Chess Query Language was designed to allow researchers, authors and players, to find topics in games, problems and studies. You have to specify the search topic and the database (PGN), where we look. When running the query (using
cql.exe ), the system creates a new file with PGN chess games that match the search topic.
As with all database drivers, CQL specifies a set small, but powerful primitives for use in the areas of chess. CQL can find much more relevant information than any other chess program. Users can search topics such as choking, nailed multiple games where the same position occurs where the winning side in a missing piece, the issues
Grimshaw and Novotny, games with a number of catches in a single cell, playing with a certain amount of passed pawns, black or white, etc.. The possibilities are endless craving.
An obvious advantage of using CQL is that you can program the search of, for example, the Greek gift (sacrifice at h7 to checkmate with a bishop), and the system will find all items in the reference database to say. Imagine what it can serve this: create books of tactics based on specific themes, where the author of the book is not to find "a man
or" every position, but this may help tool in order to find the best positions on the particular subject you are searching.
For example, consider an interesting search that makes Tim Krabbé in his excellent page of chess, where incidentally, I found the first references to CQL. Krabbé says that at some time dreamed of a combination. Here is the position of interest:
Tim Krabbé
Black to play The solution is simple: 1. ... Qh3! Nf4 + 3.Rg3 2.Rxh3 Cxe2 +
followed 4. ... Cxc3 winning.
0-1. Very simple but ... Would he have taken this position before? Or this topic (not necessarily strictly parts in the positions of the diagram). With CQL Krabbé found two studies, the first of 1954:
P. Okonkowski 
White to play and win Schach, 1954
The solution is 1.Tc6! Txc6 and now the dream combination for Krabbé: 3.Cd4 Rxf5 2.Df5 + + Re5 + RD5 5.Cxa5 4.Cxc6
and White wins. Krabbé, and something I share, CQL is the answer also to the old problem of the classification of studies savory. the basis of studies of Van der Heijden not subject classification because, among other things, assigning and label a subject is, as in literature, something that has to do with personal taste and also creating new themes or to define the existing require having to sort the basis of studies again.
Therefore, it is perhaps best to first define an interpretation and then of course, look for studies and items that are given this interpretation. For example, take the issue so fond Krabbé, the guard desguardada-a piece gives check and a piece gets in a screened box. This has happened in many games and studies, but has never been recognized as a subject in itself. In Chessbase, for example, is impossible to define this quest, but this is done CQL surprisingly easy:
: wtm : check : movefrom [QRBNP]
: moveto.
d4: d4 0 attackcount A
:
shift: flipcolor
This says that playing the white (
wtm - white to move
) and are in check (check
), and move any Room ( movefrom [QRBNP]
), except the King to the empty d4 (
moveto. d4), which has zero attacks after this ( attackcount A Ad4 0 ). Specified events may take place in any square ( shift). Finally, the last instruction ( flipcolor ) allows us to ensure that they are examples with the colors changed. You can also put ": moveto? D4 " to limit the search to cases where the piece is captured filed. Here is one of the results of this consultation with CQL, which Krabbé missed it when you played this game:
Topalov - Judit Polgar
Novgorod 1996 White to play 43.Tc7
helpless guardian is the justification for this sharp move.
43 ... Kg8 45.e6 + TB8 44.Txf7 46.Dxe3 Dxe3 + Rb1 + e3 47.Dc1 freeing to prevent the mate. Of course, Judit have seen, but maybe not, that after 47 ... Txc1 + 48.Rf2, the end is lost, for example, 48 ... Tf1 + 49.Re3 Txf7 50.d7! In the game, then continued: 48 ... Rc2 50.Re3 Bb5 49.Td7 Rc6 51.Tc7 Te2 + 52.Rf4 + 53.Rxe4 Tf2 Tf2 Te2 + 54.Rf5 + 55.Re5 + 56.Rf6 Te2 Te2 Tf2 + 57.Re7 58 . d7 Td2 Bxd7 59.Rxd7 + 60.Re8
helpless guardian is the justification for this sharp move.
43 ... Kg8 45.e6 + TB8 44.Txf7 46.Dxe3 Dxe3 + Rb1 + e3 47.Dc1 freeing to prevent the mate. Of course, Judit have seen, but maybe not, that after 47 ... Txc1 + 48.Rf2, the end is lost, for example, 48 ... Tf1 + 49.Re3 Txf7 50.d7! In the game, then continued: 48 ... Rc2 50.Re3 Bb5 49.Td7 Rc6 51.Tc7 Te2 + 52.Rf4 + 53.Rxe4 Tf2 Tf2 Te2 + 54.Rf5 + 55.Re5 + 56.Rf6 Te2 Te2 Tf2 + 57.Re7 58 . d7 Td2 Bxd7 59.Rxd7 + 60.Re8
and Black resigned. 1-0. Although CQL was developed for use with the basis of studies of Van der Heijden, which contains more than 75,000 studies, CQL can be used also with games and databases much larger. But as the system generates PGN files, convert the basis of items (usually in proprietary formats and Chessbase or Chess Assistant ), the PGN (Portable Game Notation
), Krabbé had to convert 1.9 million of games to PGN. After about 20 minutes, the Dutchman got 1.3 GB of games in a PGN file. Do research in these huge databases can take time, many hours maybe. You can still make a query in CQL to be very wide and reduce the sample to be searched. For example, it took 15 minutes Krabbé 4000 remove items where it occurs the promotion of a pawn, but in any part except for the lady. With this new database, you could find the sub issues involving promotion, which is done in about 500 times faster.
You can download Chess Query Language free. Comes with manual and many examples (scripts . CQL). It is a command line program, but the composer of Czech studies, Emil Vlasák offers VisualCQL
, a utility probably feel most comfortable to the user in a Windows environment.
CQL was developed by Gady Costeff and Lewis Stiller. Is free (with the corresponding Copyright 2003-2004). Use a database program (games in this case) of free software called Scid , developed by Shane Hudson. The version of Windows using Cygwin libraries. The site can be found
http://rbnn.com/cql/ the system to download, install and use the CQL. Photo Credit
(Start of article): DavidR_ (http://www.flickr.com
)
0 comments:
Post a Comment