25,161
edits
Changes
no edit summary
=64-bit Loop=
The [[Bitboards|bitboard]] based Loop applies [[Magic Bitboards]] for [[Sliding Piece Attacks|sliding piece attack generation]]. Further, iterative [[Alpha-Beta|alpha-beta]] bounded [[Static Exchange Evaluation|static exchange evaluation]] was applied to ''Loop Amsterdam'' <ref>[[Fritz Reul]] ('''2010'''). ''Static Exchange Evaluation with αβ-Approach''. [[ICGA Journal#33_1|ICGA Journal, Vol. 33, No. 1]]</ref> , also performing a [[Parallel Search|parallel search]] for a quad-core processor, which played a strong [[WCCC 2007]] in [https://en.wikipedia.org/wiki/Amsterdam Amsterdam], and became Third, behind the later disqualified [[Rybka]], and [[Zappa]] <ref>[https://www.game-ai-forum.org/icga-tournaments/tournament.php?id=173 15th World Computer Chess Championship - Amsterdam 2007 (ICGA Tournaments)]</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. thesis, 5.1.2 Magic Hash Functions for Bitboards, pp. 97</ref> :
