?? bitboard engine.htm
字號:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- saved from url=(0053)http://wwwipd.ira.uka.de/Tichy/DarkThought/node6.html -->
<!--Converted with LaTeX2HTML 98.1p1 release (March 2nd, 1998)originally by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds* revised and updated by: Marcus Hennecke, Ross Moore, Herb Swan* with significant contributions from: Jens Lippmann, Marek Rouchal, Martin Wilck and others --><HTML><HEAD><TITLE>Bitboard Engine</TITLE>
<META content="Bitboard Engine" name=description>
<META content=dt name=keywords>
<META content=document name=resource-type>
<META content=global name=distribution>
<META content="text/html; charset=iso-8859-1" http-equiv=Content-Type><LINK
href="Bitboard Engine.files/dt.css" rel=STYLESHEET>
<META content="MSHTML 5.00.2014.210" name=GENERATOR></HEAD>
<BODY>
<H2><A name=SECTION00124000000000000000> </A> <A name=bboard-eng> </A>
<BR>Bitboard Engine </H2>
<P>The advantages of bitboards in computer chess spring from the fact that
trivial bitwise operations on them suffice to answer interesting questions about
pieces on a chess board. For example, imagine a bitboard with 1-bits
representing all squares attacked by white Pawns and another bitboard with
1-bits indicating all black pieces. A bitwise AND operation combining both these
bitboards yields a result bitboard with 1-bits for all black pieces attacked by
white Pawns. Because computers normally excel at bitwise operations while
performing them on all bits of their natural word length simultaneously,
bitboard usage proves to be very efficient.
<P>The early proponents of the bitboard approach introduced all the basic
principles of bitboard-based move generation, piece-attack detection, and
positional evaluation [<A
href="http://wwwipd.ira.uka.de/Tichy/DarkThought/node95.html#srch:play-chess">2</A>,<A
href="http://wwwipd.ira.uka.de/Tichy/DarkThought/node95.html#bbrd:move-gen">58</A>,<A
href="http://wwwipd.ira.uka.de/Tichy/DarkThought/node95.html#prgs:cray-blitz">110</A>,<A
href="http://wwwipd.ira.uka.de/Tichy/DarkThought/node95.html#prgs:chess-4.5">184</A>,<A
href="http://wwwipd.ira.uka.de/Tichy/DarkThought/node95.html#bbrd:attack-det">207</A>].
Their publications contain a wealth of information about traditional bitboard
techniques that will not be repeated here. Instead, this article focusses on the
bitboard infrastructure and the fundamental principles of rotated bitboards as
pioneered by D<SMALL>ARK</SMALL>T<SMALL>HOUGHT</SMALL>.
<P><BR>
<HR>
<!--Table of Child-Links--><A name=CHILD_LINKS> </A>
<UL>
<LI><A href="http://wwwipd.ira.uka.de/Tichy/DarkThought/node7.html"
name=tex2html243>Bitboard Infrastructure</A>
<LI><A href="http://wwwipd.ira.uka.de/Tichy/DarkThought/node8.html"
name=tex2html244>Rotated Bitboards</A> </LI></UL><!--End of Table of Child-Links--><BR>
<HR>
<ADDRESS>Created by <A href="mailto:heinze@ira.uka.de">Ernst A. Heinz</A>, Thu
Feb 4 14:12:12 MET 1999 </ADDRESS></BODY></HTML>
?? 快捷鍵說明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -