?? iterative deepening.htm
字號:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- saved from url=(0050)http://www.npac.syr.edu/copywrite/pcw/node345.html -->
<!Converted with LaTeX2HTML 0.7a2 (Fri Dec 2 1994) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds ><HTML><HEAD><TITLE>Iterative Deepening</TITLE>
<META content="text/html; charset=hz-gb-2312" http-equiv=Content-Type>
<META content="MSHTML 5.00.2614.3500" name=GENERATOR></HEAD>
<BODY>
<META name=description value=" Iterative Deepening">
<META name=keywords value="BOOK">
<META name=resource-type value="document">
<META name=distribution value="global">
<P><BR>
<HR>
<A href="http://www.npac.syr.edu/copywrite/pcw/node346.html"
name=tex2html7007><IMG align=bottom alt=next
src="Iterative Deepening.files/next_motif.gif"></A> <A
href="http://www.npac.syr.edu/copywrite/pcw/node342.html" name=tex2html7005><IMG
align=bottom alt=up src="Iterative Deepening.files/up_motif.gif"></A> <A
href="http://www.npac.syr.edu/copywrite/pcw/node344.html" name=tex2html6999><IMG
align=bottom alt=previous
src="Iterative Deepening.files/previous_motif.gif"></A> <A
href="http://www.npac.syr.edu/copywrite/pcw/node1.html" name=tex2html7009><IMG
align=bottom alt=contents
src="Iterative Deepening.files/contents_motif.gif"></A> <A
href="http://www.npac.syr.edu/copywrite/pcw/node484.html" name=tex2html7010><IMG
align=bottom alt=index src="Iterative Deepening.files/index_motif.gif"></A>
<BR><B>Next:</B> <A href="http://www.npac.syr.edu/copywrite/pcw/node346.html"
name=tex2html7008>The Hash Table</A> <B>Up:</B> <A
href="http://www.npac.syr.edu/copywrite/pcw/node342.html"
name=tex2html7006>14.3.1 Sequential Computer Chess</A> <B>Previous:</B> <A
href="http://www.npac.syr.edu/copywrite/pcw/node344.html"
name=tex2html7000>Quiescence Searching</A> <BR>
<HR>
<P>
<H3><A name=SECTION001631300000000000000>Iterative Deepening</A></H3>
<P>Tournament chess is played under a strict time control, and a program must
make decisions about how much time to use for each move. Most chess programs do
not set out to search to a fixed depth, but use a technique called iterative
deepening.<A name=10744> </A> This means a program does a depth two search,
then a depth three search, then a depth four search, and so on until the
allotted time has run out. When the time is up, the program returns its current
best guess at the move to make.
<P>Iterative deepening has the additional advantage that it facilitates move
ordering. The program knows which move was best at the previous level of
iterative deepening, and it searches this principal variation first at each new
level. The extra time spent searching early levels is more than repaid by the
gain due to accurate move ordering.
<P><BR>
<HR>
<P>
<ADDRESS><I>Guy Robinson <BR>Wed Mar 1 10:19:35 EST 1995</I>
</ADDRESS></BODY></HTML>
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -