25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[Board Representation]] * Bitboards'''
[[File:BoardsMeeting.jpg|border|right|thumb|[[:Category:Samuel Bak|Samuel Bak]] - Boards Meeting <ref> [[:Category:Samuel Bak|Samuel Bak]] - Boards Meeting, Oil on Canvas, 39 x 32". [http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bcf Chess in the Art of Samuel Bak], [http://chgs.elevator.umn.edu/ Center for Holocaust & Genocide Studies], [https://en.wikipedia.org/wiki/University_of_Minnesota [University of Minnesota]]</ref>]]
'''Bitboards''',<br/>
* Bitboards can have a high information density.
* Single populated or even empty Bitboards have a low information density.
* <span id="getPiece"></span>Bitboards are weak in answering questions like what piece if any resides on square x. One reason to keep a redundant [[Mailbox|mailbox]] board representation with some additional [[Incremental Updates|update]] costs during [[Make Move|make]]/[[Unmake Move|unmake]].
* Bitboards can operate on all squares in parallel using bitwise instructions. This is one of the main arguments used by proponents of bitboards, because it allows for a flexibility in [[Evaluation|evaluation]].
* Bitboards are rather handicapped on 32 bit processors, as each bitwise computation must be split into two or more instructions <ref>[http://www.stmintz.com/ccc/index.php?id=30562 Efficient Bitboard Implementation on 32-bit Architecture] by [[Roberto Waldteufel]], [[CCC]], October 25, 1998</ref> . As most modern processors are now 64 bit, this point is somewhat diminished <ref>[http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6651 Speedup by bitboards] by [[Onno Garms]], [[Computer Chess Forums|Winboard Forum]], July 13, 2007</ref> .
* [[Reijer Grimbergen]] ('''2007'''). ''Using Bitboards for Move Generation in Shogi''. [[ICGA Journal#30_1|ICGA Journal, Vol. 30, No. 1]], [http://www2.teu.ac.jp/gamelab/RESEARCH/ICGAJournal2007.pdf pdf] » [[Move Generation]], [[Shogi]]
* [[James Glenn]], [http://www.cs.loyola.edu/~binkley/ David Binkley] ('''2008''') ''An Investigation of Hierarchical Bit Vectors''. [https://www.novapublishers.com/catalog/product_info.php?products_id=6555 New Topics in Theoretical Computer Science], [http://www.cs.loyola.edu/~binkley/papers/tcsrt08-hbit-vectors.pdf pdf]
* [[Shi-Jim Yen]], [[Jung-Kuei Yang]] ('''2009'''). ''The Bitboard Design and Bitwise Computing in Connect Six''. [[Conferences#GPW|14th Game Programming Workshop]] » [[Connect6]]
* [[Fritz Reul]] ('''2009'''). ''New Architectures in Computer Chess''. Ph.D. Thesis, [https://pure.uvt.nl/ws/files/1098572/Proefschrift_Fritz_Reul_170609.pdf pdf]
==2010 ...==
* [[Shi-Jim Yen]], [[Jung-Kuei Yang]], [[Kuo-Yuan Kao]], [[Tai-Ning Yang]] ('''2012'''). ''[http://www.sciencedirect.com/science/article/pii/S0950705112001293 Bitboard Knowledge Base System and Elegant Search Architectures for Connect6]''. [https://www.journals.elsevier.com/knowledge-based-systems/ Knowledge-Based Systems], Vol. 34 » [[Connect6]]
* [[Cameron Browne]], [[Stephen Tavener]] ('''2013'''). ''[http://www.aifactory.co.uk/newsletter/2012_02_fast_lane.htm Life in the Fast Lane]''. [[AI Factory]] » [http://en.wikipedia.org/wiki/Conway%27s_Game_of_Life Conway's Game of Life] within a [[Bitboards|Bitboard]]
* [[Jung-Kuei Yang]], [https://dblp.uni-trier.de/pers/hd/t/Tseng:Ping=Jung Ping-Jung Tseng] ('''2013'''). ''[https://ieeexplore.ieee.org/document/6783902 Bitboard Connection Code Design for Connect6]''. [[TAAI 2013]] » [[Connect6]]
* [[Cameron Browne]] ('''2014'''). ''Bitboard Methods for Games''. [[ICGA Journal#37_2|ICGA Journal, Vol. 37, No. 2]]
* [[Yen-Chi Chen]], [[Shun-Shii Lin]] ('''2019'''). ''A fast nonogram solver that won the TAAI 2017 and ICGA 2018 tournaments''. [[ICGA Journal#41_1|ICGA Journal, Vol. 41, No. 1]] » [[Nonogram]]
=Forum Posts=
==2005 ...==
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=4521 Bitboard question] by [[Tord Romstad]], [[Computer Chess Forums|Winboard Forum]], March 14, 2006
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5623 Yet another new bitboard move generation method] by [[Zach Wegner]], [[Computer Chess Forums|Winboard Forum]], September 22, 2006 » [[Titboards]]
: [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5623&start=6 Re: Yet another new bitboard move generation method] by [[Harm Geert Muller]], [[Computer Chess Forums|Winboard Forum]], October 01, 2006 <ref>[http://www.talkchess.com/forum3/viewtopic.php?f=7&t=52861&start=8 Re: multi-dimensional piece/square tables] by Tony P., [[CCC]], January 28, 2020</ref>
* [http://www.talkchess.com/forum/viewtopic.php?t=13426 Speedup with bitboards on 64-bit CPUs] by [[Tord Romstad]], [[CCC]], April 27, 2007
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6651 Speedup by bitboards] by [[Onno Garms]], [[Computer Chess Forums|Winboard Forum]], July 13, 2007
* [http://www.talkchess.com/forum/viewtopic.php?t=64487 Checkers Bitboard representation] by Pranav Deshpande, [[CCC]], July 02, 2017 » [[Checkers]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65724 Bitboards and Java] by [[Fred Hamilton]], [[CCC]], November 14, 2017 » [[Java]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=72461&start=3 Re: Pawn move generation in bitboards] by [[Álvaro Begué]], [[CCC]], December 05, 2019 » [[Cpp|C++]], [[Pawn Pattern and Properties]]
=Viewer & Calculator=
