Editing Bitboard (section)

==References==
{{reflist|refs=
<ref name="Atkin_1977">{{cite book |author-last1=Atkin |author-first1=Larry R. |author-last2=Slate |author-first2=David J. |editor-first=Peter W. |editor-last=Frey |date=1983 |orig-year=1977 |edition=2 |publisher=[[Springer Verlag]] |isbn=0-387-90790-4 |chapter=Chess 4.5: the Northwestern University Chess Program |title=Chess Skill in Man and Machine |citeseerx=10.1.1.111.926 |pages=82–118 }}</ref>
<ref name="Heinz_1997">{{cite journal |title=How Dark Thought Plays Chess |author-last=Heinz |author-first=Ernst A. |date=September 1997 |journal=[[ICCA Journal]] |volume=20 |issue=3 |pages=166–176 |url=http://supertech.lcs.mit.edu/~heinz/dt/node2.html}}</ref>
<ref name="Hyatt_1999">{{cite web |title=Rotated Bitboards:<!-- or bitmaps? --> New Twist on an Old Idea |author-last=Hyatt |author-first=Robert |author-link=Robert Hyatt |date=1999 |url=http://www.cis.uab.edu/info/faculty/hyatt/bitmaps.html|archive-url=https://web.archive.org/web/20050428023318/http://www.cis.uab.edu/info/faculty/hyatt/bitmaps.html |archive-date=28 April 2005 }}</ref>
<ref name="Tannous_2007">{{cite journal |author-last=Tannous |author-first=Sam |edition=2 |date=2007-07-23 |orig-year=2006 |title=Avoiding Rotated Bitboards with Direct Lookup |journal=[[ICGA Journal]] |volume=30 |issue=2 |location=Durham, North Carolina, USA |pages=85–91 |arxiv=0704.3773v2 |citeseerx=10.1.1.561.3461 |doi=10.3233/ICG-2007-30204 }}</ref>
<ref name="Knuth_1973">{{cite book |author-last=Knuth |author-first=Donald |author-link=Donald Knuth |date=1973 |title=The Art of Computer Programming |title-link=The Art of Computer Programming |volume=3 |chapter=Section 6.4. Algorithm D (Open addressing with double hashing)}}</ref>
<ref name="Sherwin_2006">{{cite web |title=Magic Bitboards Explained! |author-first1=Michael |author-last1=Sherwin |author-first2=Gerd |author-last2=Isenberg |work=Winboard Forum |date=2006-12-04 |quote=Call it Kindergarten Bitboards |url=http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5958}}</ref>
<ref name="Hansen_2006">{{cite web |title=Fast(er) bitboard move generator |author-first=Lasse |author-last=Hansen |work=Winboard Forum |date=2006-06-14 |url=http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5015}}.</ref>
<ref name="IBM_1959">{{cite journal |date=1959 |title=Some Studies in Machine Learning Using the Game of Checkers |journal=[[IBM Journal of Research and Development]]}}</ref>
<ref name="Ru_1970">{{cite journal |date=1970 |title=Programming a computer to play chess |journal=[[Russian Mathematical Surveys]]|bibcode=1970RuMaS..25..221A |last1=Adel'Son-Vel'Skii |first1=G. M. |last2=Arlazarov |first2=V. L. |last3=Bitman |first3=A. R. |last4=Zhivotovskii |first4=A. A. |last5=Uskov |first5=A. V. |volume=25 |issue=2 |page=221 |doi=10.1070/RM1970v025n02ABEH003792 }}</ref>
}}