Loop “The version examined here is Loop 2007 (64-bit), which was released at approximately the same time as the WCCC. Here we present extracts from the first section of each of Mark Watkins reports. THINKER was entered into the 2010 WCCC in Kanazawa. LOOP was entered by Fritz Reul into the 2007 WCCC in Amsterdam. ICGA President David Levy, The ICGA has received formal complaints against the Chess programs LOOP and THINKER, both of which have participated in the World Computer Chess Championship. As confirmed by David Levy, the ICGA has received a complaint on Loop by Fruit author Fabien Letouzey and an investigation has been started about this case, as already mentioned by Watkins in August 2011.
In this way the contents of this thesis can be regarded to be on a state-of the-art level of the research and development in the field of the computer-chess architectures.ĭuring the ICGA Investigations concerning the Rybka Controversy and evaluation overlaps, 64-bit Loop was inspected by Mark Watkins who found congruence with the evaluation of Fruit 2.1. This includes personal conversations with programmers, and the exchange of source codes as well as discussions via email. Many a reference used in this thesis is not available in a scientifically elaborate form. This thesis also does not aim at the explicit consideration of known computer-chess architectures, such as Rotated Bitboards or the 0x88 representation. In Preliminary Considerations he mentioned discussions with Chrilly Donninger, Fabien Letouzey and Tord Romstad, and the exchange of source codes : An essential reason for the success of this 64-bit computer-chess engine was the use of highly sophisticated perfect hash functions and magic multipliers for the computation of compound bit-patterns (bitboards) via perfect hashing.Įvaluation was only marginally covered in Reul's thesis. This engine was able to reach the 3rd place at the 15th World Computer-Chess Championship, Amsterdam (NL) 2007. įritz Reul on an essential reason of Loop's success in Amsterdam in his thesis :Ī complete computer-chess architecture based on hash functions and magic multiplications for the examination of bitboards is implemented in the computerchess engine Loop Amsterdam. Further, iterative alpha-beta bounded static exchange evaluation was applied to Loop Amsterdam, also performing a parallel search for a quad-core processor, which played a strong WCCC 2007 in Amsterdam, and became Third, behind the later disqualified Rybka, and Zappa. The bitboard based Loop applies Magic Bitboards for sliding piece attack generation. The high performance was just as important for these projects as the simplicity and ease of implementation in the following two environments: (1) the environment of a sophisticated computer-chess machine (Hydra) and (2) the environment of a commercial games console with the highest quality and security standards. The computerchess architecture was later implemented partially in Hydra and completely in Wii Chess by Nintendo (see Section 2.1). This computerchess architecture was first implemented in the quite successful computerchess engine Loop Leiden 2006. The non-bitboard data-structure of Loop was also applied in Chrilly Donninger's chess machine Hydra. A specially adapted version called Loop Express became the engine of Wii Chess for the Nintendo Wii console in 2008. It participated as Loop Leiden at the DOCCC 2006, becoming strong runner up behind Rybka.
Loop chess engine code#
The lines in Cerebellum_light.bin are in some cases reaching the late middlegame and endgame.īrainFish is licensed unter the GPL, which includes the access code to the general book format.The 32-bit program, based on Reul's former program List, relies on a 15x12 board representation in conjunction with disjoint piece-lists with adequate move generation of blocker loops.
Regarding the evaluation, only at a much higher skill level. Hence, when Brainfish is playing moves that are in the Cerebellum book, it plays like Stockfish Additionally, some others properties are found, like theīest main line of a position and possible Transitions. Position after 1.e4 must have the score -0.2.
Scores means for example, in case the starting position has a score of 0.2 and a best move is 1.e4, the Then those moves where recalulated by theĬerebellum Library using a graph algorithm that makes all scores in the library consistant. Stockfish as analysis engine, without using statistics. In Brainfish, the book moves are only used in engine games, not in analysis mode.Īll moves in the published book Cerebellum_light.bin generated by Cerebellum were calculated by using Brainfish is a standard Stockfish chess engine extended by a general book format that is capable of handling a reduced part of Cerebellum, which is an innovative chess opening and playing book.
0 kommentar(er)
