RSTCHESS

WELCOME

2012-12-15T01:53:00.000-08:00

Chess as a sport science is rooted in the area of knowledge, literature, history, and we could find relating to it in many other areas. From this site I propose several sections that overlap with literature, science and the fighting techniques of chess. It is further stipulated in this site Advanced Chess mode in vogue in recent years. In this mode I had the honor of winning the championship of Spain Ajedrez21 led by the illustrious Mr. Illescas reputed GMI and collaborator in the Deep Blue project as software consultant, personal trainer several times champion Kramnik and Spain in the form of classical chess . Similarly in the year 2003, Mr. Illescas organized an international tournament in the old server ajedrez21, which classified it in the third position. Finally I mention the illustrious Mr. Enrique Irazoqui with whom I share a passion for literature and chess. hope this site provides a meeting point for further in everything relating to chess engines, their opening books and other technical aspects how the hardware and the relevance of the advanced chess. They may also download the games from tournaments monthly Buho21 chess server, such as games made per month for my programs in playchess.com. Chess has been part of my life since childhood. I still remember my cousin, Raul Ruiz and his wife, Merche, at home the day of kings in the eighties, with his new chess board. After dinner, my cousin and I played the first game of chess. Since that day, in one form or another have been linked to the field of chess permanently.Raul Ruiz was a brilliant writer and a passionate chess. This is the reason and no other, which I've always been in the chess literature and my little place to escape from the urban workaday world. I will always be eternally grateful to my cousin, for having induced to read and play chess. Raul Ruiz's work translated into Castilian Mata Hari in Palermo by the Italian writer Leonardo Sciacci. Also helped the Catalan daily El Periodico, El Correo Catalán, Diario 16, ABC, Liberation, El Pais, and in magazines Grama, Cinema 2002, Chimaera, El Viejo Topo, Ozone Stand Kantil and peace. Unfortunately, he died on August 18, 1987 by a brain tumor, and left us one of the most brilliant writers of Spanish literature. After these first steps, started playing chess in elementary school through early nineties. At that time, the computer is in my life. I always had the belief that no humans live curiosity clueless and hibernating in the room of boredom. Fortunately, there is always curious about the unknown, ie it was made to delve into the realm of information that a few years after he joined the chess curious curio forming a family, joys and disappointments. After finishing high school, and spend a few years exploring other facets of life, since adolescence is the best time to experiment and learn, then enter adulthood with a broad vision of life, I returned to play chess and combine this with computer. Then I began to question why chess programs and their relevance in the classic game. After appearing with the Internet and appear powerful force chess programs, chess history had a before and after. It is no longer asking about the free Yugoslav textbooks related to chess, but now from a keyboard a mouse and a monitor could have all the necessary information and tools to improve your level of chess, and playing before a grand master at home. Once I found the harmony between these two areas of chess, I started to play Advanced Chess tournaments with good results. The experience has led today to dedicate this area of chess and enjoy all facets of chess. Similarly, I have met nice people with whom I maintain a friendship after many years remains today. Finally, my work focuses on creating opening books for chess engines more important today.

Jordi Ruiz

2011-03-09T07:16:00.000-08:00

1ª. SISTEMA: Suís FIDE a 8 rondes, format per un únic grup de jugadors.

2ª. DATES: els diumenges, a partir de les 9.30 hores, entre el 1 de maig i el 19 de juny.

3ª. RITME DE JOC: Serà de 90 minuts per jugador + 30 segons d’increment per jugada.

4ª. LLOC: Complex Esportiu Ricart, c/ Ricart, 6. St. Adrià de Besòs. Local climatitzat i adaptat.

5ª. SISTEMA DE DESEMPAT: El sistemes de desempat que s’aplicaran a la competició seran [Bucholz (-1), Bucholz mitjà i Progressiu FIDE]. Es sabrà l’ordre un cop finalitzada l’última ronda, després de la realització d’un sorteig públic.

6ª. L’adjudicació de premis en metàl·lic es realitzaran per estricte ordre de classificació final dels jugadors al torneig. Els premis no seran acumulatius i, si un jugador te opció a dos premis, rebrà el de més valor. Per als premis per tram s’aplicarà en primera instància l’ELO CATALÀ i, si no es tingués, l’ELO FIDE.

7ª. Els jugadors que no es presentin a la 1ª ronda, a l’igual que aquells que faltin a dues rondes, consecutives o no, sense justificació, seran eliminats. El temps d’espera si no ve el contrincant serà de 1 hora.

8ª. El director del torneig serà en Carles Madurga i els àrbitres seran en Ricard Llerins i en Daniel Gómez.

9ª. Les decisions arbitrals podran apel·lar-se per escrit al Comitè de Competició del Torneig, que estarà format pel director del torneig i dos jugadors. Existirà un full de reclamació a disposició dels jugadors. La participació al torneig implica l’acceptació de aquestes bases, les restants seran les fixades per la FCDE i FIDE, per aquests campionats.

10ª. L’Organització es reserva el dret de modificació de les bases i està supeditat a una inscripció mínima de 40 jugadors i màxima de 60 jugadors.

INSCRIPCIONS: Daniel Gómez, Tel. 627 44 84 60 danisonyeta@hotmail.com

Forma de Pagament: Conte Corrent. d’ingrés de quotes 2100/0098/80/0200467947 de LA CAIXA o abans de començar la primera ronda .

Data límit inscripció: Dissabte 30 d’abril a les 22.00 h.

Quota d’inscripció: 20€ al ingresar al conte corrent fins el 24 d'abril.

25€ després del 24 d'abril.

BOSSA DE PREMIS: 850 €

Letter to the ICGA

2011-03-02T02:32:00.000-08:00

Given the evidence that the source code of the chess program Rybka has another chess program called Fruit, a group of programmers has decided to send a joint letter to the ICGA for this association is a decision. Possible, requested the withdrawal of three world titles in chess and I imagine that there will be a before and after. Personally I think it's a complicated issue to resolve, but from here I appeal to the ethics of those involved not to damage the image of Chess Computer.

"A collection of evidence of the many cases of alleged copied/derived Fruit structure, code & data appearing in Rybka 1.0 beta has been put together in this PDF by Mark Watkins: download/file.php?id=304

It is also worth considering that prior to Rybka 1.0 beta, previous Rybka versions were many hundreds of Elo points weaker than the Rybka 1.0 beta version that suddenly emerged in public in December 2005, just a few months after the open source public release of Fruit 2.1 under the GPL license. That same month Rybka beta entered and won the International Paderborn Computer Chess tournament.

The evidence alleges that by using and deriving code, data and structure from Fruit 2.1, Vasik Rajlich was able to make dramatic and huge progress with "his" program Rybka to the detriment of his fellow competitors. In our view this has made competitions involving Rybka grossly unfair.

As chess programmers we find this overwhelming evidence compelling. We believe Rybka is a Fruit derivative albeit an advanced one.

It is very likely that later Rybka versions have derived and benefited from Rybka 1.0 beta and hence in the circumstances our view is they should also be considered derivatives of Fruit 2.1 until proven otherwise.

We wish to make an official complaint to the ICGA that Rybka is a Fruit 2.1 derivative. Furthermore we believe it is a breach of the GPL license under which Fruit 2.1 was released.

We believe as an unauthorized Fruit derivative Rybka's entry into ICGA events has been contrary to the ICGA rules and the rules of fair play.

We ask the ICGA to carefully review the evidence, assess its validity, and act accordingly.

We note that the ICGA is intending on setting up a tribunal to assess such allegations and we believe this evidence should be strongly considered in that process.

In addition, we think the ICGA should in future insist that all authors of entries to ICGA events must submit to the ICGA the same executable(s), that is taking part in the ICGA event, where they can be stored for future analysis of potential derivative claims should they arise. Each author should also make a full and clear statement as to the originality of the entry, its contributors and any acknowledgements. Should justified suspicions exist authors must be willing to submit source code on a private and confidential basis to a select group of impartial programmers to privately determine source code origin. "

Co-signed by the following chess programmers,

Fabien Letouzey

Zach Wegner

Mark Uniacke

Stefan Meyer-Kahlen

Ed Schröder

Don Dailey

Christophe Theron

Richard Pijl

Amir Ban

Anthony Cozzie

Tord Romstad

Ralf Schäfer

Gerd Isenberg

Johannes ZwanzgerBB+

Link

2010-08-27T11:48:00.000-07:00

Dear friends

this summer after five years without seeing my son, who lives in Boston, came to Barcelona to spend a week with me. On the other hand, having a clear improvement I have personally received the medical discharge and I have withdrawn the pension charge for disease. I was obliged to sell the PC to be with my son. When you have your job, because I'm not working, I will ever buy a PC and get back with you all and enjoy your company.

A greeting from Barcelona.

I Prize Book Tournament Rstchess

2010-04-30T06:52:00.000-07:00

Download games

2010-04-20T03:59:00.000-07:00

Rules of test book tournaments

Tournament Type:Round -Robin

Time Control:5 Minutes Game

HashTable Size:128 MB

Book Learning:ON

Permanent Brain:OFF

Tablebases:DVD Total Nalimov I
TB Cache:16 MB

TD: Jorge Ruiz Centelles

Book of opening one by author of the book

The size of openings do not exceed 200Mb on the Winrar software

Multiupload.com be used to upload opening books

In the month of May will be used rybka 3 (4 cores) for all opening books.

From June will be used rybka 4

Not participate in the tournament and during the progress of this

PC is not connected to internet, to avoid viruses, malware and other malicious software.

There will be a break every 24 hours to check the status of the PC and perform maintenance tasks Pc.

Overclock for the use of computers in computer chess (review deneb 965)

2010-03-04T01:46:00.000-08:00

The tests performed by the specialized media confirmed that this is the most powerful chip company in the consumer range, except for the Phenom II TWKR for obvious reasons, a special product that is not for sale. Features that bind to their ability to overclock (stable at 4 GHz without special cooling) and its compatibility with plates already on the market with DDR2, DDR3. The conclusions highlight that the 965 is highly competitive, not more faster than the more powerful Core i7, but is very close in most of the tests at a lower price. Thus, today’s Phenom II X4 965 BE introduction is actually a fairly important one for AMD. On one hand, it could earn the company its mainstream performance crown—at least for a few weeks. On the other, it could be the last time Phenom II looks as competitive as it does now. Of course, that’s going to depend mightily on how the upcoming Intel chips perform.

Up Against Core i5

Of course, we’re not able to publish performance numbers with the pre-production Core i5 processors currently running in the lab, so it’s hard to officially quantify how Phenom II will size up. But we can make best guesses using today’s Core i7s as rough test subjects.

You’ll find all of our usual benchmarks on the pages that follow. First, however, we wanted to set up Phenom II X4 965 BE against a hypothetical Core i5-750—a processor expected to cost less than $200 when it launches. We simulated the 2.66 GHz offering with a Core i7-920, which runs at the same clock rate. Of course, we had to pull out a single channel of memory (yielding two channels of DDR3-1333) and disable Hyper-Threading, since Core i5 won’t have that feature. The one variable we couldn’t reproduce was Core i5’s enhanced Turbo Boost, which is expected to accelerate clocks to 3.2 GHz when a single core is active. Core i7-920 only benefits from a single bin of Turbo Boost, yielding 2.8 GHz instead. The only other platform capability setting LGA 1156 apart from LGA 1366 is the use of on-die PCI Express 2.0, which we’ve tested extensively and can say that, in single-card configurations, has almost zero impact on performance versus the X58’s chipset-based connectivity.

As we've already mentioned, the Phenom II X4 965 Black Edition is an update to a familiar design. In fact, AMD readily admits that the silicon belongs to the same revision used to enable its Phenom II X4 955 Black Edition, running at 3.2 GHz. To that end, it centers on a 45nm manufacturing process, it features a 6MB L3 cache, boasts Cool'n'Quiet 3.0 technology, and better branch prediction than the first-generation Phenom family. Like its predecessors, the Phenom II X4 965 sports 64KB of L1 data and instruction cache per core, plus 512KB L2 cache per core, to complement the shared L3. An integrated 128-bit DDR2/DDR3 memory controller (running at 2 GHz by default) interfaces with a pair of 64-bit channels. If you're using the X4 965 on an AM2+ motherboard, speeds of up to DDR2-1066 are officially available. If you're using it on an AM3 platform, you can install DDR3-1333, though it should be noted that only one module per channel works at that frequency. And whereas AMD shipped its Phenom II X4 940 with a 1,800 MHz HyperTransport link, the X4 965 accelerates that to 2 GHz--just like the X4 955 before it. The chip's nominal voltage range is .825V-1.425V, so we won't be surprised if power consumption falls within the previous flagship's ballpark. Because it runs at 3.4 GHz, however, AMD is rating the X4 965 at 140W instead of the 125W used in previous flagship Phenom IIs.

Overclocking

The primary advantage of the new processor stepping – lower heat dissipation – should in fact tell on the frequency potential growth. To check this assumption we performed a few traditional overclocking experiments. We used a system built around Gigabyte MA790XT-UD4P mainboard and used a Thermalright Ultra-120 Extreme processor air cooler with an Enermax Magma fan installed on it.

Since Phenom II X4 965 processor we are talking about today belongs to the Black Edition series we decided to overclock it in the most natural way in this particular situation: by raising its clock frequency multiplier. At the same time I would like to remind you that as we have already seen many times before, the alternative approach using increased clock generator frequency is just as efficient.

Speaking of the overclocking results I would like to say that the CPU with new processor stepping did in fact demonstrate higher frequency potential. I would like to remind you that during the first Phenom II X4 965 C2 processor stepping tests we could get the CPU to work stably only when we increased its clock frequency from the default 3.4 to 4,0 GHz. With the new Phenom II X4 965 the overclocking with an air cooler was immediately increased by 200 MHz, (205X19.5)

The PC configuration is: :

Motherboard          ************** GA-MA790XT-UD4P***************

Ram                        **********Corsair XSM3 6Gb DDR3 8-8-8-24********

VGA                      **********ATI RADEON 4870 512MB DDR5*********

Harddisk                 **************Velociraptor 300GB******************

Chasis                     ***************Coolermaster HAF******************

PW                         *****************Corsair 750W********************

Cooler                      *******Ultra 120 Extreme rev c3, Kazee 3.000 r.p.m******

System Software And Drivers

Operating System           Windows 7 Ultimate Professional (Build 7600)

DirectX                          DirectX 10

Platform Driver               Catalyst 9.7

Graphics Driver              Catalyst 9.7

In the popular demand for games with high consumption figure test most often composed of two graphs in crossfire or sli. In our case, we are dedicated to chesscomputer with the graphics card of this team have enough for our fans. Although this chart has a good performance with overclocking configuration Mother board. will see the result with 3DMark06.

3D Mark06 rsolution 1024x768px

Winrar Benchmark

Benchmark Results: Synthetics

GIPS

Intel-Core bandwidth

Memory Bandwidth

Memory latency

Cache/Memory Bandwidth

setting the bios

We are faced with a bios that continues with the style that GIGABYTE has used recently. As usual in this brand several bios options are hidden, and we should press "Ctrl + F1" to qualify for them. Among the hidden features can be found, inter alia, the ACC as recently brought, or Advanced Clock Calibration, which has allowed unlock the fourth trinucleo core processors in some of the green flag. Among the options that will enable the overclock you have everything that we need. Highlight the memory multiplier, which in this case allow us to configure the memory up to 1600 Mhz (not the 1666 + we've seen screen-printed on the board near the ports of memory), speed far exceeding the 1333 MHz for which supports AMD processors. Highlighting the fact that along with the options to find information set voltages and speeds we are configuring end, data that will be very useful, very convenient and saves you from remembering walking or taking out the calculator.

Timmings configuration contains more options than almost anyone is capable of knowing, so we have total control over the reports. Also in this submenu are again setting the FSB and memory multiplier, so that within this submenu have all that we need to configure memory, with the exception of the voltages. It also informs us of the SPD settings and the settings that will be used if we leave everything on Auto. Perhaps the only downside is traced back to this menu to configure a timming that we must manually configure all, not be possible to leave some in "Auto". The option of "bargain" Unganged "is hidden by not pressing" Ctrl + F1 "and we will need if we are to maintain dual channel over 1333Mhz. Another feature of this bios can not forget is the information that gives us the bios on the right side of the screen on the option you have selected. It is normal that the bios give us some information about the parameters that we try to manage, but in this case was a pleasant surprise and very much to offer úti Once we configured the bios, will be spent on custom prime for at least twelve hours. Then pass the test benches and bench to see the overclocking performance of our audit. I recommend having the HT link multiplier to x7 and x8 multiplier = 1800Mhz NB, since turning down synchronously the NB HT Link and performance is not adequate. But special attention to the HT link, since it is always better to have X7 or down depending on clock frequency. Regarding the voltage, the default Vcore of the processor is 1,350. I've adjusted at 1.50 the vocre 1.550 the VcpuidNB 1,550, NB SB +0.2 to +0.2 ram 1.65 and the thermal solution of the review are stable at 4000MHz. With exceptional performance relative to the price we paid for the processor. 155 € Deneb 965 rev. c3

Conclusion

As for the new AMD Phenom II X4 965 processors on the new core stepping introduced today we can certainly recommend them to those computer enthusiasts that have good reasons to go with Socket AM2/AM3 platform. The CPUs with new processor stepping will definitely be better than their predecessors. However, it is important to remember that top quad-core AMD processors are currently a pretty weak offering against the background of their competitors. In fact, they can only compete against the old similarly priced LGA775 CPUs and only in terms of nominal mode performance. Fortunately, we can conclude that the results provide a processor with a ópitmo performance and value for money which is very interesting. With the i5 intel core market remains the midrange processors offer a high rendmiento, but the performance difference on the price, this phenom makes an interesting option for enthusiasts gammers.

World Computer Chess Championship

2010-03-02T23:15:00.000-08:00

World Computer Chess Championship (WCCC) is an annual event where computer chess engines compete against each other. The event is organized by the International Computer Games Association. It is often held in conjunction with the Computer Olympiad, a collection of computer tournaments for other board games.

Championship results

The WCCC was open to all types of computers including microprocessors, supercomputers, clusters, and dedicated chess hardware.In 2007, the reigning champion Junior declined to defend its title.

For the 2009 edition, the rules were changed to limit platforms to commodity hardware sporting at most eight cores, thereby excluding supercomputers and large clusters.

World Microcomputer Chess Championship

From 1980 to 2001, there was a separate cycle of championships limited to programs running on microprocessors. Up until 1991, the winners were dedicated units. Thereafter, winners were running on state-of-the-art personal computers. The event was also run by the ICGA.

At the 14th WMCCC in Jakarta, the Israeli Junior team was denied entry to Indonesia and some other teams dropped out in protest.

The 16th WMCCC was the same as the 9th WCCC above.

World Computer Speed Chess Championship

World Computer Speed Chess Championship is an annual event where computer chess engines compete against each other at blitz chess time controls. It is held in conjunction with the World Computer Chess Championship. Up to 2001, it was held in conjunction with the World Microcomputer Chess Championships and restricted to microcomputers.

Maastricht 2002

Graz 2003

Ramat-Gan 2004

Reykjavík 2005

Turin 2006

Amsterdam 2007

Beijing 2008

Pamplona 2009

The organizer of the ICGA and chesscomputers tournaments on its website have any additional information on the official chess engines, the events held and planned for future tournaments this year, 2010.

2010-03-01T01:51:00.000-08:00

Computer chess

Computer chess is computer architecture encompassing hardware and software capable of playing chess autonomously without human guidance. Computer chess occurs as solo entertainment (allowing players to practice and to amuse themselves when no human opponents are available), as aids to chess analysis, for computer chess competitions, and as research to provide insights into human cognition.

For a time in the 1970s and 1980s it was unclear whether any chess program would ever be able to defeat the expertise of top humans. In 1968, International Master David Levy made a famous bet that no chess computer would be able to beat him within ten years. He won his bet in 1978 by beating Chess 4.7 (the strongest computer at the time), but acknowledged then that it would not be long before he would be surpassed. In 1989, Levy was defeated by the computer Deep Thought in an exhibition match. Deep Thought, however, was still considerably below World Championship Level, as the then reigning world champion Garry Kasparov demonstrated in two sterling wins in 1989. It was not until a 1996 match with IBM's Deep Blue that Kasparov lost his first game to a computer at tournament time controls in Deep Blue - Kasparov, 1996, Game 1. This game was, in fact, the first time a reigning world champion had lost to a computer using regular time controls. However, Kasparov regrouped to win three and draw two of the remaining five games of the match, for a convincing victory.

In May 1997, an updated version of Deep Blue defeated Kasparov 3½-2½ in a return match. A documentary mainly about the confrontation was made in 2003, titled Game Over: Kasparov and the Machine. IBM keeps a web site of the event.

With increasing processing power, chess programs running on commercially available workstations began to rival top flight players. In 1998, Rebel 10 defeated Viswanathan Anand who at the time was ranked second in the world, by a score of 5-3. However most of those games were not played at normal time controls. Out of the eight games, four were blitz games (five minutes plus five seconds Fischer delay (see time control) for each move) these Rebel won 3-1. Then two were semi-blitz games (fifteen minutes for each side) which Rebel won as well (1½-½). Finally two games were played as regular tournament games (forty moves in two hours, one hour sudden death) here it was Anand who won ½-1½ [9]. At least in fast games, computers played better than humans but at classical time controls - at which a player's rating is determined - the advantage was not so clear.

In the early 2000s, commercially available programs such as Junior and Fritz were able to draw matches against former world champion Garry Kasparov and classical world champion Vladimir Kramnik.

In October 2002, Vladimir Kramnik and Deep Fritz competed in the eight-game Brains in Bahrain match, which ended in a draw. Kramnik won games 2 and 3 by "conventional" anti-computer tactics - play conservatively for a long-term advantage the computer is not able to see in its game tree search. Fritz, however, won game 5 after a severe blunder by Kramnik. Game 6 was described by the tournament commentators as "spectacular." Kramnik, in a better position in the early middlegame, tried a piece sacrifice to achieve a strong tactical attack, a strategy known to be highly risky against computers who are at their strongest defending against such attacks. True to form, Fritz found a watertight defense and Kramnik's attack petered out leaving him in a bad position. Kramnik resigned the game, believing the position lost. However, post-game human and computer analysis has shown that the Fritz program was unlikely to have been able to force a win and Kramnik effectively sacrificed a drawn position. The final two games were draws. Given the circumstances, most commentators still rate Kramnik the stronger player in the match.

In January 2003, Garry Kasparov played Junior, another chess computer program, in New York. The match ended 3-3.

In November 2003, Garry Kasparov played X3D Fritz. The match ended 2-2.
In 2005, Hydra, a dedicated chess computer with custom hardware and sixty-four processors and also winner of the 14th IPCCC in 2005, defeated seventh-ranked Michael Adams 5½-½ in a six-game match (though Adams' preparation was far less thorough than Kramnik's for the 2002 series).[10]
In November-December 2006, World Champion Vladimir Kramnik played Deep Fritz. This time the computer won, the match ended 2-4. Kramnik was able to view the computer's opening book. In the first five games Kramnik steered the game into a typical "anti-computer" positional contest. He lost one game (overlooking a mate in one), and drew the next four. In the final game, in an attempt to draw the match, Kramnik played the more aggressive Sicilian Defence and was crushed.
There was speculation that interest in human-computer chess competition would plummet as a result of the 2006 Kramnik-Deep Fritz match. According to McGill University computer science professor Monty Newborn, for example, "the science is done"

Human-computer chess matches showed the best computer systems overtaking human chess champions in the late 1990s. For the 40 years prior to that, the trend had been that the best machines gained about 40 points per year in the ELO ranking while the best humans only gained roughly 2 points per year.[12] There was speculation that audience interest in human-computer chess competition would wane as a result of matches such as the 2006 Kramnik-Deep Fritz match in which Kramnik lost the match 4 games to 2.[13] The highest rating obtained by a computer in human competition was Deep Thought's USCF rating of 2551 in 1988 and FIDE no longer accepts human-computer results in their rating lists. Specialized machine-only ELO pools have been created for rating machines but such numbers, while similar in appearance, should not be directly compared.[14] A recent top chess engine, Rybka, has an estimated ELO rating of about 3200 (when running on an up-to-date PC, as computed by SSDF).

Advanced Chess is a form of chess developed in 1998 by Kasparov where a human plays against another human, and both have access to computers to enhance their strength. The resulting "advanced" player was argued by Kasparov to be stronger than a human or computer alone, although this has not been proven.

Implementation issues

The developers of a chess-playing computer system must decide on a number of fundamental implementation issues. These include:

Board representation — how a single position is represented in data structures,

Search techniques — how to identify the possible moves and select the most promising ones for further examination,

Leaf evaluation — how to evaluate the value of a board position, if no further search will be done from that position.

Computer chess programs usually support a number of common de facto standards. Nearly all of today's programs can read and write game moves as Portable Game Notation (PGN), and can read and write individual positions as Forsyth-Edwards Notation (FEN). Older chess programs often only understood long algebraic notation, but today users expect chess programs to understand standard algebraic chess notation.

Most computer chess programs are divided into an engine (which computes the best move given a current position) and a user interface. Most engines are separate programs from the user interface, and the two parts communicate to each other using a public communication protocol. The most popular protocol is the Xboard/Winboard Communication protocol. Another open alternate chess communication protocol is the Universal Chess Interface. By dividing chess programs into these two pieces, developers can write only the user interface, or only the engine, without needing to write both parts of the program. (See also List of chess engines.)

Implementers also need to decide if they will use endgame databases or other optimizations, and often implement common de facto chess standards.

Search techniques

The first paper on the subject was by Claude Shannon — published in 1950 before anyone had programmed a computer to play chess. He successfully predicted the two main possible search strategies which would be used, which he labeled "Type A" and "Type B" (Shannon 1950).

Type A programs would use a "brute force" approach, examining every possible position for a fixed number of moves using the minimax algorithm. Shannon believed this would be impractical for two reasons.

First, with approximately thirty moves possible in a typical real-life position, he expected that searching the approximately 109 positions involved in looking three moves ahead for both sides (six plies) would take about sixteen minutes, even in the "very optimistic" case that the chess computer evaluated a million positions every second. (It took about forty years to achieve this speed.)

Second, it ignored the problem of quiescence, trying to only evaluate a position that is at the end of an exchange of pieces or other important sequence of moves ('lines'). He expected that adapting type A to cope with this would greatly increase the number of positions needing to be looked at and slow the program down still further.

Instead of wasting processing power examining bad or trivial moves, Shannon suggested that "type B" programs would use two improvements:

1. Employ a quiescence search.

2. Only look at a few good moves for each position

This would enable them to look further ahead ('deeper') at the most significant lines in a reasonable time. The test of time has borne out the first approach; all modern programs employ a terminal quiescence search before evaluating positions. The second approach (now called forward pruning) has been dropped in favor of search extensions.

Adriaan de Groot interviewed a number of chess players of varying strengths, and concluded that both masters and beginners look at around forty to fifty positions before deciding which move to play. What makes the former much better players is that they use pattern recognition skills built from experience. This enables them to examine some lines in much greater depth than others by simply not considering moves they can assume to be poor.

More evidence for this being the case is the way that good human players find it much easier to recall positions from genuine chess games, breaking them down into a small number of recognizable sub-positions, rather than completely random arrangements of the same pieces. In contrast, poor players have the same level of recall for both.

The problem with type B is that it relies on the program being able to decide which moves are good enough to be worthy of consideration ('plausible') in any given position and this proved to be a much harder problem to solve than speeding up type A searches with superior hardware and search extension techniques.

One of the few chess grandmasters to devote himself seriously to computer chess was former World Chess Champion Mikhail Botvinnik, who wrote several works on the subject. He also held a doctorate in electrical engineering. Working with relatively primitive hardware available in the Soviet Union in the early 1960s, Botvinnik had no choice but to investigate software move selection techniques; at the time only the most powerful computers could achieve much beyond a three-ply full-width search, and Botvinnik had no such machines. In 1965 Botvinnik was a consultant to the ITEP team in a US-Soviet computer chess match (see Kotok-McCarthy).

One developmental milestone occurred when the team from Northwestern University, which was responsible for the Chess series of programs and won the first three ACM Computer Chess Championships (1970-72), abandoned type B searching in 1973. The resulting program, Chess 4.0, won that year's championship and its successors went on to come in second in both the 1974 ACM Championship and that year's inaugural World Computer Chess Championship, before winning the ACM Championship again in 1975, 1976 and 1977.

One reason they gave for the switch was that they found it less stressful during competition, because it was difficult to anticipate which moves their type B programs would play, and why. They also reported that type A was much easier to debug in the four months they had available and turned out to be just as fast: in the time it used to take to decide which moves were worthy of being searched, it was possible just to search all of them.

In fact, Chess 4.0 set the paradigm that was and still is followed essentially by all modern Chess programs today. Chess 4.0 type programs won out for the simple reason that their programs simply played better chess. Such programs did not try to mimic human thought processes, but relied on full width alpha-beta and negascout searches. Most such programs (including all modern programs today) also included a fairly limited selective part of the search based around quiescence searches, and usually extensions and pruning (particularly null move pruning from the 1990s onwards) which were triggered based on certain conditions in an attempt to weed out or reduce obviously bad moves (history moves) or to investigate interesting nodes (e.g. check extensions, passed pawns on seventh rank, etc). Extension and pruning triggers have to be used very carefully however. Over extend and the program wastes too much time looking at uninteresting positions. If too much is pruned, there is a risk cutting out interesting nodes. Chess programs differ in terms of how and what types of pruning and extension rules are included as well as in the evaluation function. Some programs are believed to be more selective than others (for example Deep Blue was known to be less selective than most commercial programs because they could afford to do more complete full width searches), but all have a base full width search as a foundation and all have some selective components (Q-search, pruning/extensions).

Though such additions meant that the program did not truly examine every node within its search depth (so it would not be truly brute force in that sense), the rare mistakes due to these selective search was found to be worth the extra time it saved because it could search deeper. In that way Chess programs can get the best of both worlds.

Furthermore, technological advances by orders of magnitude in processing power have made the brute force approach far more incisive than was the case in the early years. The result is that a very solid, tactical AI player aided by some limited positional knowledge built in by the evaluation function and pruning/extension rules began to match the best players in the world. It turned out to produce excellent results, at least in the field of chess, to let computers do what they do best (calculate) rather than coax them into imitating human thought processes and knowledge. In 1997 Deep Blue defeated World Champion Garry Kasparov, marking the first time a computer has defeated a reigning world chess champion in standard time control.

Computer chess programs consider chess moves as a game tree. In theory, they examine all moves, then all counter-moves to those moves, then all moves countering them, and so on, where each individual move by one player is called a "ply". This evaluation continues until a certain maximum search depth or the program determines that a final "leaf" position has been reached (e.g. checkmate).

A naive implementation of this approach can only search to a small depth in a practical amount of time, so various methods have been devised to greatly speed the search for good moves.

Leaf evaluation

For most chess positions, computers cannot look ahead to all final possible positions. Instead, they must look ahead a few plies and then evaluate the final board position. The algorithm that evaluates final board positions is termed the "evaluation function", and these algorithms are often vastly different between different chess programs.

Evaluation functions typically evaluate positions in hundredths of a pawn, and consider material value along with other factors affecting the strength of each side. When counting up the material for each side, typical values for pieces are 1 point for a pawn, 3 points for a knight or bishop, 5 points for a rook, and 9 points for a queen. (See Chess piece relative value.) By convention, a positive evaluation favors White, and a negative evaluation favors Black.

The king is sometimes given an arbitrary high value such as 200 points (Shannon's paper) or 1,000,000,000 points (1961 USSR program) to ensure that a checkmate outweighs all other factors (Levy & Newborn 1991:45). Evaluation functions take many factors into account, such as pawn structure, the fact that a pair of bishops are usually worth more, centralized pieces are worth more, and so on. The protection of kings is usually considered, as well as the phase of the game (opening, middle or endgame).

See Claude Elwood Shannon for a description of his early paper about a chess-playing program.

Using endgame databases

Some computer chess operators have pointed out that endgame tablebases have the potential to weaken performance strength in chess computers if incorrectly used. Because some positions are analyzed as forced wins for one side, the program will avoid the losing side of positions at all costs. However, many endgames are forced wins only with flawless play, where even a slight error would produce a different result. Consequently, most modern engines will play many endgames well enough on their own. A symptom of this problem is that computers may resign too early because they see that they are being forced into a position that is theoretically dead lost (although they may be thirty or more moves away from the end of the game, and most human opponents would find it hard to win in that time). This observation is only relevant when a computer program is in a situation where it has a choice between two losing moves, one of which is actually more difficult for the opponent, but leads to a tablebase position with a known value, and is hence of very minor importance.

The Nalimov tablebases do not consider the fifty-move rule, under which a game where fifty moves pass without a capture or pawn move can be claimed to be a draw by either player. This results in the tablebase returning results such as "Forced mate in sixty-six moves" in some positions which would actually be drawn because of the fifty-move rule. However, a correctly programmed engine does know about the fifty-move rule, and in any case if using an endgame tablebase will choose the move that leads to the quickest win (even if it would fall foul of the fifty-move rule with perfect play). If playing an opponent not using a tablebase, such a choice will give good chances of winning within fifty moves.

One reason for this is that if the rules of chess were to be changed once more, giving more time to win such positions, it will not be necessary to regenerate all the tablebases. It is also very easy for the program using the tablebases to notice and take account of this 'feature'.

The Nalimov tablebases, which use state-of-the-art compression techniques, require 7.05 GB of hard disk space for all five-piece endings. To cover all the six-piece endings requires approximately 1.2 terabyte. It is estimated that seven-piece tablebases will require more storage capacity than will be available in the foreseeable future.[citation needed]

It is surprising, but easily verified, that without an endgame tablebase even otherwise very strong chess engines may fail to find a winning plan even in endings with six or fewer pieces, when they need more moves than the calculation horizon to achieve a checkmate, a win of material or the advance of a pawn. Many endings require more moves than their calculation horizon.

Computers have been used to analyze some chess endgame positions completely. Such endgame databases are generated in advance using a form of retrograde analysis, starting with positions where the final result is known (e.g., where one side has been mated) and seeing which other positions are one move away from them, then which are one move from those, etc. Ken Thompson, perhaps better known as the key designer of the UNIX operating system, was a pioneer in this area.

Endgame play had long been one of the great weaknesses of chess programs because of the depth of search needed, with some otherwise master-level programs being unable to win in positions that even intermediate human players would be able to force a win.

The results of the computer analysis sometimes surprised people. In 1977 Thompson's Belle chess machine used the endgame tablebase for a king and rook against king and queen and was able to draw that theoretically lost ending against several masters (see Philidor position#Queen versus rook). This was despite not following the usual strategy to delay defeat by keeping the defending king and rook close together for as long as possible. Asked to explain the reasons behind some of the program's moves, Thompson was unable to do so beyond saying the program's database simply evaluated its moves as best it could.

Most grandmasters declined to play against the computer in the queen versus rook endgame, but Walter Browne accepted the challenge. A queen versus rook position was set up in which the queen can win in thirty moves, with perfect play. Browne was allowed 2½ hours to play fifty moves, otherwise a draw would be claimed under the fifty-move rule. After forty-five moves, Browne agreed to a draw, being unable to force checkmate or win the rook within the next five moves. In the final position, Browne was still seventeen moves away from checkmate, but not quite that far away from winning the rook. Browne studied the endgame, and played the computer again a week later in a different position in which the queen can win in thirty moves. This time, he captured the rook on the fiftieth move, giving him a winning position (Levy & Newborn 1991:144-48), (Nunn 2002:49).

Other positions, long believed to be won, turned out to take more moves against perfect play to actually win than were allowed by chess's fifty-move rule. As a consequence, for some years the official FIDE rules of chess were changed to extend the number of moves allowed in these endings. After a while, the rule reverted back to fifty moves in all positions — more such positions were discovered, complicating the rule still further, and it made no difference in human play, as they could not play the positions perfectly.

Over the years, other endgame database formats have been released including the Edward Tablebases, the De Koning Endgame Database (released in 2002) and the Nalimov Endgame Tablebases which is the current standard supported by most chess programs such as Rybka, Shredder or Fritz. All endgames with five or fewer pieces have been analyzed completely. Of endgames with six pieces all positions have been analyzed except for positions with five pieces against a lone king.[15] Some seven-piece endgames, have been analyzed by Marc Bourzutschky and Yakov Konoval.[16] In all of these endgame databases it is assumed that castling is no longer possible.

Endgame databases are generated by storing in memory the values of positions which have been encountered so far, and using these results to lop off the ends of the search trees if they arise again. Although the number of possible games after a number of moves rises exponentially with the number of moves, the number of possible positions with a few pieces is exponential only in the number of pieces — and effectively limited however many end game moves are searched. The simple expediency of remembering the value of all previously reached positions means that the limiting factor in solving end games is simply the amount of memory available in the computer. While computer memory sizes are increasing exponentially, there is no reason why end games of increasing complexity should not continue to be solved.A computer using these databases will, upon reaching a position in them, be able to play perfectly, and immediately determine whether the position is a win, loss or draw, plus the fastest or longest way of getting to that result. Knowledge of whether a position is a win, loss or draw is also helpful in advance since this can help the computer avoid or head towards such positions depending on the situation.

Endgame databases featured prominently in 1999, when Kasparov played an exhibition match on the Internet against the Rest of the World. A seven piece Queen and pawn endgame was reached with the World Team fighting to salvage a draw. Eugene Nalimov helped by generating the six piece ending tablebase where both sides had two Queens which was used heavily to aid analysis by both sides.llll

Chronology of computer chess

The idea of creating a chess-playing machine dates back to the eighteenth century. Around 1769, the chess playing automaton called The Turk became famous before being exposed as a hoax. Before the development of digital computing, serious trials based on automata such as El Ajedrecista of 1912, were too complex and limited to be useful for playing full games of chess. The field of mechanical chess research languished until the advent of the digital computer in the 1950s. Since then, chess enthusiasts and computer engineers have built, with increasing degrees of seriousness and success, chess-playing machines and computer programs.

*1769, Wolfgang von Kempelen builds the Automaton Chess-Player, in what becomes one of the greatest hoaxes of its period.

*1868, Charles Hooper presented the Ajeeb automaton — which also had a human chess player hidden inside.

*1912, Leonardo Torres y Quevedo builds a machine that could play King and Rook versus King endgames.

*1948, Norbert Wiener's book Cybernetics describes how a chess program could be developed using a depth-limited minimax search with an evaluation function.

*1950, Claude Shannon publishes "Programming a Computer for Playing Chess", one of the first papers on the problem of computer chess.

*1951, Alan Turing develops on paper the first program capable of playing a full game of chess.

*1952, Dietrich Prinz develops a program that solves chess problems.

1956, Los Alamos chess is the first program to play a chess-like game, developed by Paul Stein and Mark Wells for the MANIAC I computer.

*1956, John McCarthy invents the alpha-beta search algorithm.

*1958, NSS becomes the first chess program to use the alpha-beta search algorithm.

*1958, The first programs that could play a full game of chess were developed, one by Alex Bernstein and one by Russian programmers using a BESM.

*1962, The first program to play credibly, Kotok-McCarthy, is published at MIT

*1966-1967, The first chess match between computer programs is played. Moscow Institute for Theoretical and Experimental Physics (ITEP) defeated Kotok-McCarthy at Stanford University by telegraph over nine months.

*1967, Mac Hack Six, by Richard Greenblatt et al. introduces transposition tables and becomes the first program to defeat a person in tournament playchessville

*1968, David Levy makes a bet with AI researchers that no computer program would win a chess match against him within 10 years.

*1970, The first year of the ACM North American Computer Chess Championships

*1974, Kaissa wins first World Computer Chess Championship

*1977, The first microcomputer chess playing machine, CHESS CHALLENGER, was created

*1977, The International Computer Chess Association is established.

1977, Chess 4.6 becomes the first chess computer to be successful at a major chess tournament.

*1978, David Levy wins the bet made 10 years earlier, defeating the Chess 4.7 in a six-game match by a score of 4.5-1.5.

*1980, The first year of the World Microcomputer Chess Championship

*1980, The Fredkin Prize is established

*1981 Cray Blitz won the Mississippi State Championship with a perfect 5-0 score and a performance rating of 2258. In round 4 it defeated Joe Sentef (2262) to become the first computer to beat a master in tournament play and the first computer to gain a master rating.

*1982, Ken Thompson's hardware chess player Belle earns a US master title.

*1988, HiTech developed by Hans Berliner and Carl Ebeling wins a match against grandmaster Arnold Denker 3.5 - 0.5.

*1988, Deep Thought shares first place with Tony Miles in the Software Toolworks Championship, ahead of a former world champion Mikhail Tal and several grandmasters including Samuel Reshevsky, Walter Browne and Mikhail Gurevich. It also defeats grandmaster Bent Larsen, making it the first computer to beat a GM in a tournament. Its rating for performance in this tournament of 2745 (USCF scale) was the highest obtained by a computer player.[22][23]

*1989, Deep Thought loses two exhibition games to Garry Kasparov, the reigning world champion.

*1992, first time a microcomputer, the ChessMachine Gideon 3.1 by Ed Schröder from The Netherlands, wins the 7th World Computer Chess Championship in front of mainframes, supercomputers and special hardware.

*1996, Deep Blue loses a six-game match against Garry Kasparov.

*1997, Deep Blue wins a six-game match against Garry Kasparov.

*2002, Vladimir Kramnik draws an eight-game match against Deep Fritz.

*2003, Kasparov draws a six-game match against Deep Junior.

*2003, Kasparov draws a four-game match against X3D Fritz.

*2004, a team of computers (Hydra, Deep Junior and Fritz), wins 8.5-3.5 against a rather strong human team formed by Veselin Topalov, Ruslan Ponomariov and Sergey Karjakin, who had an average ELO rating of 2681.

*2005, Hydra defeats Michael Adams 5.5-0.5.

*2006, the undisputed world champion, Vladimir Kramnik, is defeated 4-2 by Deep Fritz.

*2009, A Mobile phone-class hardware won a category 6 tournament. Chess engine Hiarcs 13 ran as the Pocket Fritz 4 on the mobile phone HTC Touch HD. The HTC Touch HD won the 2009 Copa Mercosur in Buenos Aires, Argentina with 9 wins and 1 draw on August 4-14, 2009

References

Hsu, Feng-hsiung (2002), Behind Deep Blue: Building the Computer that Defeated the World Chess Champion, Princeton University Press, ISBN 0-691-09065-3

Levy, David; Newborn, Monty (1991), How Computers Play Chess, Computer Science Press, ISBN 0-7167-8121-2

Newborn, Monty (1975), Computer Chess, Academic Press, New York

Newborn, Monty (1997), Kasparov versus Deep Blue: Computer Chess Comes of Age, Springer, ISBN 0-387-94820-1 (This book actually covers computer chess from the early days through the first match between Deep Blue and Garry Kasparov.)

Nunn, John (2002), Secrets of Pawnless Endings, Gambit Publications, ISBN 1-901983-65-X

Shannon, Claude E. (1950), "Programming a Computer for Playing Chess" (PDF), Philosophical Magazine Ser.7, Vol. 41 (314), http://archive.computerhistory.org/projects/chess/related_materials/text/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon.062303002.pdf, retrieved 21 June 2009

Mastering the Game: A History of Computer Chess at Computer History Museum

Bill Wall's Computer Chess History Timeline

Chess Photo Gallery

2010-02-15T01:15:00.000-08:00

Censorship in Computer Chess

2010-02-05T10:28:00.000-08:00

For many months all chess fans and enthusiasts and advanced chess engine they hope the new version of Rybka chess engine, after announcing publicly that its interface chessOK have the right to update the long-awaited Rybka 3 Rybka 4, the author dissociates itself from the announcement of ChessOK, and currently there is no release date for the new version of chess engine going. There are certain flaws in the Rybka chess engine from the past and have not yet been resolved. Persistent Hash and the controversy that existed in the past with the chess engine Strelka. In May 2007, a new chess engine called Strelka appeared on the scene, claimed to be written by Yuri Osipov. Soon, there were allegations that Strelka was a clone of Rybka 1.0 beta, in the sense that it was a reverse-engineered and slightly modified version of Rybka.[39] Several players found Strelka to yield identical analysis to Rybka in a variety of different situations, even having the same bugs and weaknesses in some cases. Osipov, however, stated repeatedly on discussion boards that Strelka was based on Fruit, not Rybka, and that any similarities was either because Rybka also was based on Fruit, or because he had tuned the evaluation function to be as close to Rybka as possible.[40][41]

With the release of Strelka 2.0 beta, source code was included. Rajlich stated that the source made it "obvious" that Strelka 2.0 beta was indeed a Rybka 1.0 beta clone, although not without some improvements in certain areas. On basis of this, he claimed the source as his own and intended to re-release it under his own name,[42] although he later decided not to do so. He also made allegations that "Yuri Osipov" was a pen name. And today the apparition of the chess engine is named Ippolit has led the author going to say that this is a chess engine Rybka 1.0 clone, as in the past said on the same terms with the chess program Strelka. The chess engine IPPOLIT was released in October 2009 with its source code. Vasik Rajlich alluded that IPPOLIT may be a decompiled version of Rybka, and that the people involved kept him informed of their progress via email.[43] Since then several follow-up versions of IPPOLIT have been published, the last of those also support multiprocessing. Due to the possibility of plagiarism, neither Ippolit nor any of its derivatives (Firebird, Robbolito, Igorrit, Tankist) have been accepted into computer chess rating lists.[citation needed]. In this situation there appears to be presumed innocent until proven otherwise it'll, has demonized these chess engines and censorship show has brought back many malpractice chess servers employees committing all kinds of payment of crimes covered in the possibility of plagiarism of such engines. Its use has been prohibited, without which now has scientific evidence with a court ruling that affirms the plagiarism and infringement of copyright.Therefore this whole situation typical of a thriller screenplay makes me stick to Mr. Kevin Frayer in its proposal regarding this controversy and injustice in a sport science that is usually characterized by the nobility of its practitioners.

Comments from operators who decry the freedom of users on a chess server

"you are a "persona non grata" at the Playchess Engine Room so your recommendations mean absolutely nothing to me. Others should take note of this as well."

sign to Rob Osborne

engine room playchess, administrator

Jordi Ruiz

EVGA Motherboard

2010-01-27T17:31:00.000-08:00

EVGA is keeping up its streak of releasing high-end motherboards for processors based on the new Intel Nehalem architecture, with a new dual-socket monstrosity. Slated for CES 2010, not much about this high-end workstation motherboard has been revealed beyond the picture below. From the looks of it, probably EVGA is making a high-end, overclocker-friendly dual LGA-1366 motherboard based on the Intel 5500 "Tylersburg" chipset with the usual ICH10R southbridge. Existing LGA-1366 processors that support dual-socket operation which includes Xeon 5500 series may work on it. Probably, a future high-end Intel Core family CPU is released that is capable of dual-socket setups, too. The picture reveals two LGA-1366 sockets, each powered by an 8-phase digital PWM circuit. Each socket is wired to six DDR3 DIMM slots supporting triple-channel memory for that socket. More this CES.

Intel 'Nehalem' Xeon 5500 series

Intel sent us an S5520SC motherboard - estimated price £450 - with a pair of W5580s. That's jolly nice of the chip giant as the new CPUs have an official price of $1554 each in batches of 1000 which is about £1200 per CPU. That’s the thick end of three grand for two processors and a motherboard. We didn’t get a pair of CPU coolers in the package which would usually pose a problem, but the new Xeons use the same LGA1366 socket as Core i7 so you can employ regular desktop coolers in your Xeon 5500 workstation. No doubt there will also be low profile wind-tunnel coolers for rack-mounted servers with the new CPUs.The chipset on the S5520SC motherboard is an Intel 5520 - aka 'Tylersburg'. When we reviewed Core i7 we said: "In addition to the X58 chipset, we noted that the Intel INF driver also applies to chipset models 5520 and 5550 so it seems that there are more Nehalem chipsets in the works." That’s the 5520 accounted for so we can only guess that the 5550 chipset will support 5500 Xeons in a four-way configuration. The major changes from the Core 2 technology in 5400 Xeons to the new 5500 models are the adoption of QuickPath Interface (QPI) and the integrated DDR 3 memory controller, which has moved from the chipset to the CPU core. This means that one of the biggest jobs for Tylersburg is to supply PCI Express and it does this in spades, with six lanes of original PCIe and 36 lanes of PCIe 2.0 for graphics. We have no doubt that Xeon motherboards will appear from Asus, SuperMicro and Tyan with four graphics slots and full support for SLI as well as CrossFire.The S5520SC motherboard has six DDR 3 memory slots for each of the two sockets and it did a solid job for us. But it's an uninspiring motherboard for a reviewer working with a new processor. The twin graphics slots support CrossFire but not SLI, the Bios doesn’t have any overclocking features and some of the more funky features, such as the ServerEngines SM4210 KVM chip, played no part in the proceedings.It may seem unfair for us to accuse a workstation motherboard of being dull but we almost inevitably regard the new Xeons and 5520 chipset as the natural successor to Skulltrail. Skulltrail joined two processors with plenty of PCI Express and a choice of CrossFire or SLI to deliver what you might term ‘an ultimate gaming experience’ provided you could put up with the racket from all the cooling fans and the heat from the FB-DIMM memory. With Xeon 5500 we were looking for a more civilised version of Skulltrail as Core i7 has superb power management features and requires minimal cooling. The same is true of DDR 3 system memory.

We plugged the two Xeons into the S5520SC motherboard with three 1GB sticks of 1066MHz DDR 3 Ram for each CPU, a GeForce GTX 280 graphics card and a WD Caviar Black hard drive running 64-bit Windows Vista. The power figures that we quote are measured at the mains socket for the whole system. However, it's quite easy to work out the power draw of the W5580. We ran POV-Ray with one and two Xeons and can confidently state that the W5580 draws 70W when it's idling in Windows and 120W fully loaded. We compared the single and dual Xeons with a Core i7 965 Extreme on an MSI X58 Pro as well as Skulltrail. For some reason, Skulltrail wouldn’t POST with the GTX 280 installed so we used an - ahem - as-yet-unannounced Radeon HD which has very similar performance to the GTX 280. The key point here is that all of the CPUs were running at 3.2GHz so we are comparing architecture and system design with the clock speed as a level playing field.

It came as little surprise that a single Xeon and the Core i7 delivered performance that was nearly identical. Adding a second Xeon was initially something of a disappointment as gaming performance in Crysis and Far Cry 2 wasn’t helped one jot as the software can't use the extra eight cores.

Verdict

The new Nehalem Xeons deliver a level of multi-threaded performance that is breathtaking..

By Leo Waldock

Server Tournament Rules

2010-01-23T07:03:00.000-08:00

RULES

Compulsory Server Rules

Dear Chess Friends,

chess on a chess server is a great thing. You can meet like-minded people and compare your skills in nice games. However, for a fair and friendly competition some rules are necessary. They follow an easy principle: those who treat others badly or break a rule will be banned from the server – notwithstanding further consequences.

If you have any questions you are welcome to ask a system operator or a ChessBase employee in the chat – you recognize them by the entry „ChessBase" or by the entry „Sysop" under their status in the player list. Or just send a mail to these adress.

Server Tournament Rules

About seven months of tournament-play lie behind us now. We used the experiences gained during this time to develop the program technically. But these experiences also found their way into the following set of rules. The idea behind them is to make decisions of our tournament-directors easier to understand, to inform players about proceedings on the server and to make the modalities of awarding prizes more transparent. However, we are not perfect. Therefore: if you have any question about the rules or if you have any proposals to make, just send me a mail.

The rules apply from 01. January 2003. The most important changes are the partly lifted anonymity when winning a prize and the awarding of rating-prizes. We take it that all player are acquainted with these rules.

Tournament Rules for Official Server-Tournaments

§ 1 Purview of these rules

(1) The rules apply to all official tournaments played on this server. Deviations from these rules will be especially announced.

(2) If not stated differently in the following, the current rules of the International Chess Federation (FIDE) apply.

§ 2 The players

(1) The players are responsible for their individual internet-connection. The players are responsible for being present in the virtual tournament hall when the lots are drawn for each round, when the round starts, and when the game begins. The players are also responsible for downloading the most recent version of the software they use (Fritz 7, Fritz 8, Shredder etc.). If a player fails to comply to these rules he/she has no right at all to demand that the consequences of his/her failure to comply to these rules should be redressed. Above all, there is no right to let the game start anew.

(2) The players have to follow the instructions of the tournament-director, particularly in regard to closing the board-window, starting new games and continuing games. The players are also obliged to answer all questions of the tournament-director relating to the tournament immediately.

(3) The players are responsible for registering in time for a tournament. The player has to enter the tournament room, in which the tournament is played. After that, the player has to send a special-registration-message to the tournament director (marked by the Sysop-symbol and the rank of "Tdirektor"). This is done via the chat by sending the word „join“ to the tournament-director. Fritz 8 users can register by clicking the "Join Event" button. The registration is confirmed by the tournament director (you are in ... ). The tournament-director often sends an alphabetical list of registrations to the participants. It is the task of the players to check whether they were entered into the tournament. Being entered into a round that is already under way is not possible. In this case, you can only enter in the following round.

(4) The players are responsible for having their chat-window opened throughout the entire tournament, that is during the games and during the waiting periods between games; they have to make sure that they can be reached through the chat throughout the entire tournament.

(5) The players have to comply to the rules of conduct and the general rules on the server. Above all, insults to your playing-partner and insults to third parties should be avoided. It is also strictly forbidden to make use of computer-programs for support during the games. We will report on our homepages and in the press about any case of cheating using the name and personal data of a person who cheats. In addition, we will confiscate all ducats a player has won on our server - in any tournament - and delete his ducat-account.

(6) The players have to abstain from being unfair. Above all, it is unfair to start chatting to other players during a game or to leave a tournament without reason. If stepping back from a tournament is absolutely necessary, you have to inform the tournament-director and wait for his confirmation.

§ 3 The tournament-director

(1) The tournament-director has to take care of an efficient an timely execution of the tournament, and has to make sure that the rules are complied to.

(2) In case of dispute only the tournament-director has the right to decide whether a game has to be played again or how games that are aborted due to prolonged lags are rated. In case of the latter, the tournament-director should award the game to the player with the shorter lag. If this is not clear or if it cannot be established which player is responsible for the technical delay of the game or why the connection was delayed, the game should be declared drawn.

(3) All decisions of the tournament-director about executing the tournament, rating games and awarding prizes are non-appealable.

(4) If rules are violated or if players behave in an unfair way, the tournament-director has the right to impose sanctions. He might

count the current game as a loss;

ban a player from the tournament;

ban a player from the server for a certain amount of time;

decrease the player's rank;

let the account of a player be deleted.

§ 4 Server-disconnection

(1) If the connection is interrupted during a tournament or if the majority of the players lose their connection because of problems with the server-connection, the tournament-director decides how to continue the tournament. If possible the tournament should be continued, especially when the break does not last longer than 30 minutes. Only if there are two rounds or less left to play the tournament-director should – unless circumstances indicate not to do so – cancel the tournament prematurely.

(2) If the tournament-director decides to continue the tournament the interrupted round should – if there are any doubts – be started entirely new. Games that were already finished do not count and have to be played again.

§ 5 Prizes

(1) Prizes can only be won by players who give their complete name, their complete address and a correct and current email-address to the tournament-director. It is not sufficient to mention that the address or the email-address of the player is known to another tournament-director or to ChessBase.

(2) Prizes can only be won when the player agrees that his or her real name might be published in the tournament-reports on the server – or in the chess press. Players who want to remain anonymous cannot win prizes.

(3) Non-money prizes, no matter of which kind, cannot be changed.

(4) Prizes will be played out as announced in the invitation. If the invitation published in one of the reports differs from the invitation in the tournament room, the invitation in the tournament room is binding. In case of doubt, the German version of the invitation is binding.

§ 6 Rating-prizes

(1) § 5 of these rules apply unless otherwise indicated.

(2) Rating-prizes can only be won by players whose rating during their last 400 games before the tournament has not been more than 150 points above the given rating-limit.

(3) The tournament-director can exclude players from winning rating-prizes when they haven't yet played 100 games in the discipline, in which the prize is played out. As a rule, the tournament-director should do so, if the player's data do not contain any information about the real name, the address, the playing strength and the membership in a club.

(4) A player is completely excluded from winning a prize if he/she submits a wrong name.

(5) Rating-prizes and prizes can only be won with the same permanent handle/nickname. If a player claims prizes under two different handles/nicknames this will lead to a three-month ban from any prizes. This does not apply if the player informs the tournament director about the changed handle/nickname prior to the tournament, and states why the handle was changed and if the tournament-director accepts this explanation.

(6) Every player can only win a maximum number of two rating-prizes per calendar-month. Should he/she win more prizes only the first two will be awarded. In this case it is in the discretion of the tournament director whether the prize is given to the following player or whether the prize can be won in one of the following tournaments.

§ 7 Language

Communication with the tournament-director has either to be in German or in English – this is a matter of choice. The tournament-director can allow communication in additional languages.

§ 8 Elimination of legal proceedings

Legal proceedings for all cases of conflict resulting from these rules are eliminated. This applies above all to questions of awarding prizes.

§ 9 Validity

These rules are valid from 01. January 2003.

Playchess

2010-01-23T06:59:00.000-08:00

RULES

Compulsory Server Rules

Dear Chess Friends,

chess on a chess server is a great thing. You can meet like-minded people and compare your skills in nice games. However, for a fair and friendly competition some rules are necessary. They follow an easy principle: those who treat others badly or break a rule will be banned from the server – notwithstanding further consequences.

If you have any questions you are welcome to ask a system operator or a ChessBase employee in the chat – you recognize them by the entry „ChessBase" or by the entry „Sysop" under their status in the player list. Or just send a mail to these adress.

Your ChessBase company

Server – Rules

As of 25. February 2005

Preliminary remarks

The following rules serve to guarantee a harmonious togetherness of the chess players. When using the server please remember that this is a family-oriented server and that there are children and juniors who here enjoy their hobby chess. This server is not for discussing political, ideological or religious questions. Fairness should be the first consideration when dealing and playing with each other. The following rules are compulsory rules for using the server. But to presume that everything not explicitly forbidden here is permitted, is, however, wrong.

§ 1 Creating a user-name

1.

The following rules apply when creating a new account:

Using handles which insult others is not permitted.

Using handles which are likely to offend ethical, ideological or religious feelings of others is not permitted.

Using proper names for handles is only permitted if you use your own name.

Using handles which contain or present a link to a website is not permitted. Inserting links into the personal profile is only permitted if

a. this is a link to your own website or

b. the linked website is directly related to chess

2.

To give false information in the personal profile is not permitted. It is not permitted to use language or pictures of any kind which contain attacks on other persons or sexual or pornographic depictions. It is neither permitted to use language or pictures of any kind which are likely to offend the ethical, ideological or religious feelings of others.

Access accounts which are not given clearance by a serial number can be deleted, unless they are recognizable as a recent test account of a new player who wants to get to know software and server. If in doubt, please be quick to enter your serial number.

3.

In principle it is not allowed to sell an existing account with a rating (server-ELO9 or to give it to an other player in any other way.

4.

Failure to comply to the compulsory rules under 1. to 3. may lead to an immediate deletion of the account. In case of recurrence access to the server may be closed for all accounts of the user. Moreover, failure to comply also allows the ChessBase GmbH to pass on stored data for further legal action either under criminal or civil law.

§ 2 Using software

Using the server is only permitted with a properly registered software confirmed by a serial number. A failure to enter the serial number after being asked to do so – even if asked by the program – leads to a deletion of the account unless it is software especially provided by the ChessBase GmbH for a certain user for a certain amount of time (test- or special-clients).

§ 3 Behavior in the chat

1.

The chat helps players to communicate. The same rules as for creating an account (§ 1 item 1 and 2) apply.

Chatting on a chess server has the same legal status as any verbal or written communication between individuals, and above all it is public. Insults have legal consequences, and severe insults and sedition in particular may lead to criminal prosecution. For this, every player can be unambiguously identified through his IP-address confidentially stored by the server.

2.

It is not allowed to post web-addresses or URLs in the chat. This does not apply if these are web-addresses or URLs, which are mainly chess-related and do not only serve commercial interests.

3.

Contravening these rules, and insulting in the chat in particular, may lead to de-ranking or a temporary or complete closure of the account or the power to chat.

§ 4 Using chess programs

1.

Using chess programs outside of the machine-rooms to play or to support play is forbidden. The server and software programs monitor whether players use chess programs.

2.

Violating these rules will lead to a closure of the account, even if the account is released through a serial-number. In case of recurrence the player may even be banned from playing on the server.

§ 5 Manipulating the rating

1.

Any kind of rating manipulation is strictly forbidden, like i.e. increasing an ELO-rating (padding or boosting) by losing intentionally or losing intentionally (dumping), and it does not matter if this manipulation is achieved through losing against one's own accounts, friends or acquaintances.

2.

It is not to permitted to play rated games under the name of a different player. Violating this rule may be punished with de-ranking or closure of both accounts. We would like to explicitly draw attention to the fact that every player is responsible for taking care that no other player uses his/her handle to play. The player has to take care that his/her password is known to nobody else.

§ 6 Technical manipulation

It is not permitted to interfere with the technical processes of the server or the game. Above all, it is not permitted to slow down play by manipulating your own system. Violating these rules will lead to a deletion of the account, and in case of recurrence it will lead to close access to the server.

§ 7 Pirating software

1.

It is explicitly forbidden to play on the server with illegal software copies. Moreover, it is also explicitly forbidden to use the server as platform for distributing illegal software or data collections. It is forbidden to use the server as platform to initiate contacts which aim to exchange, to trade or to pass on illegal software, no matter whether for money or for free. Excluded from this are freeware or shareware programs as well as the Nalimov tablebases and other software not subject to any copyright.

2.

Breaching these rules may lead to an immediate closure of access to the server. Moreover, the operator of the server, the ChessBase GmbH, in these cases has the right to use stored data for pursuing copyright claims, either under criminal or civil law.

§ 8 Tournament

1.

For official tournaments the respective tournament rules apply.

2.

In the private tournament rooms everybody with the rank of bishop or better may organize tournaments. But to promise prizes, no matter of what kind, is not possible in private tournaments. In particular, it is not permitted to promise money-prizes. Violating this rule will at least lead to a de-ranking to the rank of knight.

3.

Clubs or net-communities with a virtual tournament room of their own, may promise prizes for tournaments. However, they may only do so if the tournament and the prizes which can be won, are announced on the homepage of the club, which is linked to the server. Violating this rule will lead to closing the tournament room.

§ 9 Ducats

1.

Ducats are the internal currency on the playchess.com server. Within certain limits they can be used as stakes in games or in tournaments or they can be transferred between players as payment for services or they can be used for buying products in the ChessBase shop.

2.

To win ducats in tournaments the rank of Pawn is sufficient. In addition to that the Fritz 8 program or a more recent program is required.

3.

To play for ducats the rank of Bishop or better is required.

4.

Transferring ducats also requires the rank of Bishop or better.

5.

Receiving ducats at least requires the rank of Queen.

6.

In principle, ducats can only be exchanged for articles of the ChessBase GmbH. Here, they can be used for payments with an exchange-rate of 10 ducats for € 1,00.

7.

Titleholders and coaches may offer services (playing, training, simultaneous displays, etc.) on the server, and ask the participants for ducats for making use of these services. Renumerating these services later in EUR through the ChessBase GmbH is only possible through an individual contractual agreement. If interested, please send an email to info@chessbase.com.

§ 10 Law to be used

For all disputes about the application of these rules and its resulting sanctions German law is to be used.

Letter to readers

2010-01-23T00:28:00.000-08:00

"Dear Editor Chessbase Company based in Hamburg is currently the world reference in terms of chess software. Moreover, this company has an online chess server, which is accessed by buying their chess programs or, on the other hand, buying a serial number that entitles you to a year of access to the playing area. In this area of play is common to find a world chess champion and the most representative players of today. However, some server administrators, Holger Lieske, send emails expelling many users who have paid their annual dues for years. When when writing applicant an answer, no answer. Bureaufax, either. Some players are still buying and serial number are expelled within a few days, after detecting the Ip. Fraud has reached users in all countries: Spain and USA basically. I state these facts as Holger Lieske public complaints against the company Chessbase and against allowing the arbitrary use of his duties as administrator.

A greeting"

Jorge Ruiz Centelles

Letter sent to the press with more widespread nationally

User Manual for buho21

2010-01-19T00:04:00.000-08:00

The first step we must take to access the play area is register on the web buho21.Following registration we will install the latest version of Java, but we have it installed, since it is required to enter the playing area.

We successfully completed our nickname registration and will make a brief explanation of the features and software buho21, in the same way, how to play chess program in the playing area. On the other hand, it is important to specify during the registration process we're going to play with software. This will identify the user as advanced chess player or centaur. You can see that not only is there the possibility of playing chess. Multijuegos Buho21 is a server, and there are different possibilities. However, we will focus exclusively on chess, since the objective is to become familiar with the interface buho21 to play on the server. The steps are relatively simple, since the graphics are quite intuitive buho21 presents.In the gaming area will observe that in the chart appears in the center window challenges offered by the players, and on the right side the list of connected users, and other options that offer chess lessons, tournaments and events.

Once the registry and installed the latest version of Java compatible with your operating system, go into the chess room. .As you can see in the chart and as I said before, the interface is simple and intuitive. Now inside the chess room, the next steps are simple. I pointed out in different states image user membership: VIP, with the star, guest room you can play chess, but can not enjoy the options it offers VIP membership status and finally the masters federation, MI and GMI.

At the top left clearly specify different ranges of user.At the bottom left different Modalities of play classical chess, chess advanced (C) to blind etc. Similarly, in the bottom left you can see the icons that distinguish the different modes of play. On the right side of the chart we can see the players that are connected, you can chat with other users and, moreover, ask the managers that will help you if you have any questions. Now we will play once we are clear about the basic functioning of buho21 interface. Because this server has Hispanic heritage, users typically communicate in Spanish, though, we must choose English and then we can make all the steps much faster. It is also possible to switch to other languages, therefore, have to congratulate the team of developers to promote chess in different languages.

By checking the option to play button appears at the top left you'll see another sale like you see in the image. As we advanced chess players have white box computer, if we mark may not play against other computers. Similarly, there is the possibility of tick off who lost (not very well seen, except those users who repeatedly accept challenges and then cancel the game. To avoid controversy, better to ignore these players), will put the rhythm we are interested in playing in this sense strongly recommend you check on the interface that we use for our program, one less minute real time game, to have scope to make the plays on both the interface and the interface buho21 engine chess. Check the option of starting evaluated (rated) or leave blank if you do not want to add or lose points. At this point I recommend playing with points, as the chess mind is not to lose or win, but what that entails fighting chess.You can also enjoy other forms of chess, but to play other kinds are not able to use the software, since it is covered by the rules buho21 server, as in other chess servers. Having set all options in response to our gaming needs, we will mark the ok, and our icon will appear in the central window of the interface. Then wait to accept our challenge. However, to play the tournaments we make another step, although recommend play some games against other users to familiarize themselves with this new format. Similarly, there are times when there are not many advanced users online chess, I recommend the following server time slot 20:00 to 00:00 server time. With this brief guide for I completed the first step to get familiar with software buho21. Information will expand the tournament to play once they have finalized the dates, times and pace of play. I suggest you to contact me to receive proposals on this issue.

Jordi Ruiz

History Intel & AMD

2010-01-05T12:11:00.000-08:00

On the advanced chess mode hardware has an important role when it comes to maximize the performance of the chess engine. Therefore, I am going to briefly recount the history of the two most popular assemblers and processors used to play chess programs. That is, AMD and Intel.

Intel® & AMD®

Integrated Electronics Intel®

Intel was founded in 1968 by the hand of Gordon Moore and Robert Noyce, with the goal of harnessing the technology of integrated circuits to replace the magnetic memory usage. His first major success has it in 1970 to launch the DRAM.

integrated circuits for only one unit in a memory to store a program that allows you to perform all actions. Today, Intel has enabled the development from this microprocessor-art technologies like dual-core processor or Hyper-Treading ™. The latest development is the i7 Intel ™ processor, large capacity, the fastest currently known and which is intended to replace its predecessor more assimilated the Core2Duo ™.

Advanced Micro Deviced AMD®

AMD was founded in 1969 by the hand of Jerry Sanders, in order to produce logic chips. It soon evolved to the semiconductor market, demand for the manufacturers of computer equipment. The year 1975 is launching a clone of the 8080 microprocessor from Intel, created through reverse engineering. Parallel Bit Slicing technology introduced to market incorporating AMD processors for microcomputer.

The year 2000 introduced to the market known as K7 Athlon ™, its first seventh-generation processor. The latest new AMD Phenom ™ processor is its IIx4 (quad core), more powerful processors for better technology.

Technical Concepts

Microprocessor: Device core of the motherboard and the whole team. This depends largely on the power and performance of the system. Hertz (Hz): Corresponds to one cycle per second, ie the number of repetitions of a task in a second or frequency. The GHz is equivalent to one billion cycles per second (1,000,000,000,000 Hz). In computing represents the number of instructions that a microprocessor can execute per second.

Bit: Binary digit or bit that uses 01 for the encoding of digital information. A Bandwidth is equivalent to 8 bits. One gigabyte is equivalent to 2 bytes. RAM: Random Access Memory, or random access memory. It is the temporary memory that is erased when the computer shuts down.

Cache: Copy a computer that keeps the pages you've visited lately, so if the user returns to apply for them, they are read from the hard drive without having to reconnect to the network, thus achieving a very significant improvement in speed.

Intel ® Microprocessor

A moving average with Intel microprocessors, was concerned largely on the speed and power consumption, thus trying to increase first and decrease in the other. Speeds up to 233 MHz, including a version of 200 MHz speeds up to 233 MHz, including a version of 200 MHz are low-cost microprocessors. They perform the same basic functions but with a lower yield and is more apparent in advanced applications such as games. CPU Speed: 266 MHz to 3.6 GHz.

The Intel ® Pentium ® processor with Intel ® Dual-Core offers a superlative performance for PCs and laptops, consumes less power and allows multiple computing tasks at the same time everyday. CPU Speed: 1.4 GHz to 2.5 GHz

Its main feature is the decrease in energy without compromising the speed of the microprocessor, thus performing multiple tasks at the same time.

Latest Intel processor that brought to market more quickly in the various programs ejecutacion because it eliminates the memory bus connecting the processor that makes the chipset as all cores are now under the same chip can reach transfer speeds Data up to 25.6 GB / sec. Its disadvantage, increased energy consumption. 2.93 GHz and 2.66 GHz core speed.

AMD ® Microprocessors

Processor that was created under the name of k7. It has quickly with digital media (videos, images, CAD / CAM and audio files), technology has 3D Now! Professional and QuantiSpeed ™ architecture. AMD worked with Microsoft on the Windows XP version. PCs with AMD Duron processors are the practical choice for everyday use. They offer an ideal combination of features and performance for their programs and operating systems. Its many advanced features allow the manufacture of PCs with AMD Duron processors ideal for personal use and for the company. AMD Sempron processors for notebooks and desktop PCs will offer affordable performance, compatibility with all applications you use every day and traditional reliability of AMD processors. Compatible with all major operating systems and more than 60,000 of the most popular applications.

The fastest dual-core mobile processors with processing power and memory improved to be able to do more, faster. The power to do it all: high-speed and responsiveness in all your applications, all the time. in addition to exceptional performance. new possibilities for making the most of the games, digital entertainment and productivity with the phenomenal performance of the AMD Phenom native multi-core.

Advantages and disadvantages AMD Intel

At the time of the execution of office software AMD ® processors get better performance. In the execution of optimized software and video representation, as the case of graphic designers who need high speeds and capabilities, Intel has done better. In energy terms, Intel ® has a distinct disadvantage to consume approximately 86% more energy than a processor like AMD ® performance. In the execution of sets of complex graphics, AMD ® has a better response than its counterpart Intel ® . It is faster in multimedia. At the time of AMD ® multimedia work shows greater efficacy than their counterparts two. The Intel ® audio performance gets slightly better results. It is slower in multimedia. The multiple tests performed in works show a clear trend towards greater effectiveness in the use of Intel ® thanks to Hyper-Threading technology that optimizes the processor.

Conclusions

Each processor either Intel or AMD has specific high performance characteristics, namely a clear focus for work which has been proposed. Therefore, only the user can determine which processor and that company is one that satisfazce customer requests, optimize processes and providing maximum performance in different executions.

Chess Videos

2009-12-28T03:13:00.001-08:00

2009-12-16T04:51:00.005-08:00

Hardware

Cpu Phenom Codename Deneb 965@ 4000Mhz

Ram 8GB DDR3 Corsair XSM3 16000 Cas 8

Motherboard GA-MA790XT-UD4P

Hard Disk Velociraptor 300 GB 10.000 r.p.m 7,3 ms

Case Haf 932 Coolmaster

Watercooling Watercool HK Rev 3.0; Laing D5 Swiftech MCP655 ; Radiator 12 cm Triple- TFC X-Changer 360 Triple; Alphacool HF 38 Cape Cyclone 250

Software

Gui Fritz 12; Total Nalimov I

Proven system stability with the prime software, 3D Mark06, Cinebench, SuperPi Mod 1.5

Setting test opening books

Uci engine Rybka 3 ( Juny with Rybka 4)

setting by default, Contemp value= 0

Hash Table= 256Mb

Size Cache Egtbs= 16Mb

DOWNLOAD

2009-12-16T04:51:00.003-08:00

CTG. Book

Jorge Ruiz ( LesChats rybka, LesMatous, private)

LesChats 2.4 2010-15-04

1-100

OurBook

This book of openness is open for my friends who wish Chess.Nforum.Biz reborn and develop it. To find out about this book you can visit my tutorial published in the archive section Blog

Arena's book format = *.abk

We collect "Arena opening books" and "Arena engine books"

WinRAR can be found under:.rarlab

For the opening books we used the program winRAR!

Harry Schnapp (Arena Main Opening Book)

Updated: 2009-01-19: h-schnapp-v80__mainbook.rar (6.53 MB, 63.76 MB *.abk)

Moves: 2.354.265

Book depth: 68 halfmoves

2009-01-19: h-schnapp-v02__little.rar (0.70 MB, 5,75 MB *.abk)

Moves: 189.616

Book depth: 24 halfmoves

Kevin Frayer

Heretic .Is a smaller more flexible book. (149Mb uncompressed)

Heretic 2.8.abk

Sedat Canbaz

Updated: 2005-05-15: s-canbaz-v071__perfect.rar (2,21 MB, 24 MB *.abk)

Moves: 862.609

Book depth: 40 halfmoves

Alexander Schmidt (Shredder)

a-schmidt-v03__shredder.rar (0,50 MB, 3 MB *.abk)

Moves: 120.149

Book depth: 70 halfmoves

Selection of games and databases

Rstchess collection

Update 27-02-2010

CCRL

Update 2010-04-11

ICCF Games Archive

CEGT databases

Last update : 11 Apr 2010

FCCRL BLITZ

Last update: 2010-22-03

ICGA

Last update 2010-17-05

March Games

April Games

Match Igorrit x64 Vs Ivanhoe T-63 Mini5

Games

2009-12-16T04:51:00.001-08:00

International Correspondence Chess Federation

Link

RATINGS

2009-12-16T04:50:00.006-08:00

The updated list of chess engine rating published by the computerchess website. In my opinion, Deep Sjeng chess engines and DeepJunior should be better positioned, as in the microcomputer world had seats of honor paths between the top four.

CCRL Rating List

CEGT Rating list

IPON- Rating List

ICGA 2010

LINKS

2009-12-16T04:50:00.005-08:00

FIDE

Kevin Frayer

Sedat Canbaz

Internet Chess Club

Buho21

Mundialchess

Chess&Learn

Ches zone

HardLimit

GeniusProphecy

FEC

EDAMI

IPON

2009-12-16T04:50:00.003-08:00

News Fritz 13

News London R8: Vlad The Anglocide

CONTACT

2009-12-16T04:50:00.001-08:00

rstchess@gmail.