Changes

an [[UCI]] compliant [[:Category:Open Source|open source chess engine]] written by [[Raimund Heid]] in [[C]], distributed under the [[Free Software Foundation#GPL|GNU General Public License GPL]]. Protector already started its life in early 2000 <ref>[http://www.schach-welt.de/interviews/raimund-heid Interview] with [[Raimund Heid]], by [[Frank Quisinsky]], [http://www.schach-welt.de/ Schachwelt.de], February 20, 2010 (German)</ref> , and over the time incorporated many public ideas and techniques known from other open source programs, notably [[Crafty]], [[Fruit]], [[Toga]], [[Glaurung]]/[[Stockfish]] and [[RobbolitoRobboLito]]. It can be compiled to run under [[Windows]], [[Linux]] and [[Mac OS]]. Protector is incorporated in the cluster chess project [[GridProtector]] by [[Kai Himstedt]] which had its debut at [[PT 49]].

Protector is based on many great ideas from the following people: [[Fabien Letouzey]] (pvnodes, [[Tapered Eval|blending of opening and endgame values]], eval params), [[Thomas Gaksch]] ([[PV Extensions|pvnode extensions]], [[Futility Pruning#Extendedfutilitypruning|extended futility pruning]], space attack eval), [[Robert Hyatt]] ([[Shared Hash Table#Lockless|consistent hashtable entries]]), [[Stefan Meyer-Kahlen]] ([[UCI]]), [[Gerd Isenberg]] <ref>Thank you! ([[Gerd Isenberg]], March 16, 2013) My own contribution to [[Magic Bitboards]] was the line-wise forerunner, dubbed [[Kindergarten Bitboards]], also tried with "random" factors, while [[Lasse Hansen]] had the idea to hash both lines simultaneously. I was initially skeptical whether the huge tables pay off.</ref> /[[Lasse Hansen]] ([[Magic Bitboards|magic bitboards]]), [[Marco Costalba]]/[[Tord Romstad]]/[[Joona Kiiski]] ([[Glaurung]]/[[Stockfish]] sources), [[Ippolit|Igor/Yakov]] ([[RobbolitoRobboLito]] sources), [[Andrew Kadatch]]/[[Eugene Nalimov]] ([[Endgame Tablebases|endgame tablebases]]), Frank Rahde (testing) and Wolf Stephan Kappesser (Adaptations for [[Mac OS]]). Without their contributions Protector would not be what it is. Thank you so much.