Changes

an [[UCI]] compliant chess engine by [[Fritz Reul]] with different [[Board Representation|board representations]] for 32-bit and 64-bit platforms, at times commercial. Loop became subject of its author's Ph.D. thesis ''New Architectures in Computer Chess'' <ref>[[Fritz Reul]] ('''2009'''). ''New Architectures in Computer Chess''. Ph.D. Thesisthesis</ref> . Despite different board representation, both Loop versions presumably share same [[Search|search]] and [[Evaluation|evaluation]] with similar features and weights.

The 32-bit program, based on Reul's former program [[List (Program)|List]], relies on a [[Vector Attacks#15x12|15x12 board]] representation in conjunction with disjoint [[Piece-Lists#NewArchitecture|piece-lists]] with adequate [[Move Generation|move generation]] of [[Vector Attacks#NewArchitecture|blocker loops]]. It participated as ''Loop Leiden'' at the [[DOCCC 2006]], becoming strong runner up behind [[Rybka]]. A specially adapted version called ''Loop Express'' became the engine of [[Wii Chess]] for the [https://en.wikipedia.org/wiki/Nintendo Nintendo] [https://en.wikipedia.org/wiki/Wii Wii] [https://en.wikipedia.org/wiki/Video_game_console console] in 2008 <ref>[[Fritz Reul]] ('''2009'''). ''New Architectures in Computer Chess'', Ph.D. Thesisthesis, 2.2.2 Nintendo Wii Chess, pp. 11</ref> . The non-bitboard data-structure of Loop was also applied in [[Chrilly Donninger|Chrilly Donninger's]] chess machine [[Hydra]] <ref>[[Fritz Reul]] ('''2009'''). ''New Architectures in Computer Chess'', Ph.D. Thesisthesis, 2.2.1 The Chess Machine Hydra, pp. 11</ref> .

Reul in his thesis <ref>[[Fritz Reul]] ('''2009'''). ''New Architectures in Computer Chess'', Ph.D. Thesisthesis, 5.1.1 Non-Bitboard Architectures, pp. 96</ref> :

Fritz Reul on an essential reason of Loop's success in Amsterdam in his thesis <ref>[[Fritz Reul]] ('''2009'''). ''New Architectures in Computer Chess'', Ph.D. Thesisthesis, 5.1.2 Magic Hash Functions for Bitboards, pp. 97</ref> :

Evaluation was only marginally covered in Reul's thesis. In ''Preliminary Considerations'' he mentioned discussions with [[Chrilly Donninger]], [[Fabien Letouzey]] and [[Tord Romstad]], and the exchange of source codes <ref>[[Fritz Reul]] ('''2009'''). ''New Architectures in Computer Chess'', Ph.D. Thesisthesis, 1.2 Preliminary Considerations, pp. 3-4</ref> : This thesis also does not aim at the explicit consideration of known computer-chess architectures, such as [[Rotated Bitboards]] <ref>[[Stuart Cracraft]] ('''1984'''). ''Bitmap move generation in Chess''. [[ICGA Journal#7_3|ICCA Journal, Vol. 7, No. 3]]</ref> <ref>[[Robert Hyatt]] ('''1999'''). ''[http://www.cis.uab.edu/hyatt/bitmaps.html Rotated Bitmaps, a New Twist on an Old Idea]''. [[ICGA Journal#22_4|ICCA Journal, Vol. 22, No. 4]]</ref> or the [[0x88]] representation <ref>[http://web.archive.org/web/20070716111804/www.brucemo.com/compchess/programming/0x88.htm 0x88 Move Generation] by [[Bruce Moreland]]</ref>. Many a reference used in this thesis is not available in a scientifically elaborate form. This includes personal conversations with programmers <ref>[[Chrilly Donninger]] ('''2006'''). ''Discussion with Dr. Christian Donninger''.</ref>, <ref>[[Fabien Letouzey]] ('''2006'''). ''Personal discussion with Fabien Letouzey''.</ref> <ref>[[Tord Romstad]] ('''2007'''). ''Discussion with Tord Romstad''.</ref> , and the '''exchange of source codes''' as well as discussions via email. 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.

* [[Fritz Reul]] ('''2009'''). ''New Architectures in Computer Chess''. Ph.D. Thesisthesis, [https://pure.uvt.nl/ws/portalfiles/portal/1098572/Proefschrift_Fritz_Reul_170609.pdf pdf]