games.html

来自「Data Structure Ebook」· HTML 代码 · 共 64 行

HTML

64 行

<HTML><HEAD>
<TITLE>Data Structures and Algorithms: Games</TITLE>

<META name="description" content="Data Structures and Algorithms Course Notes,
PLDS210 University of Western Australia">
<META name="keywords" content="data structures,algorithms,abstract data types ">
</HEAD>
<BODY BGCOLOR="#ffffff">
<TABLE BGCOLOR="#00c0f0" WIDTH="100%" CELLSPACING=0 CELLPADDING=0>
<TR BGCOLOR="#00f0f0"><TD ALIGN=right>
<FONT FACE=helvetica SIZE=+1><I>Data Structures and Algorithms</I></FONT>
</TD></TR>

<TR><TD><FONT FACE=helvetica SIZE=+2><B>14 Games</B></FONT>
</TD></TR>
</TABLE>
<P>

<H3>Naive Solutions</H3>

A naive program attempting to play a game like chess will:
<OL TYPE=a>
<LI> Determine the number of moves which can be made from the current position,
<LI> For each of these moves,
<OL TYPE=i>
<LI> Apply the move to the current position,
<LI> Calculate a "score" for the new position,
<LI> If the maximum search "depth" has been reached, 
       return with this score as the score for this move,
<LI> else recursively call the program with the new position.
</OL>
<LI> Choose the move with the best score and return its score
     and the move generating it to the calling routine.
</OL>
Because there are usually at least 20 possible moves from any given chess
position, to search to a depth of <B>m</B> requires ~20<SUP>m</SUP></B>
moves.
Since good human players usually look 10 or more moves ahead,
the simple algorithm would severely tax the capabilities of even the
fastest modern computer.
<P>
However, with a little cunning, the number of moves which needs to be
searched can be dramatically reduced - enabling a computer to search
deeper in a reasonable time and, as recent events have shown, 
enable a computer to finally be a match for even the best human players.

<H3>Alpha-Beta Algorithm</H3>

The Alpha-Beta algorithm reduces the number of moves which need to be
explored by "cutting off" regions of the game tree which cannot produce
a better result than has already been obtained in some part of the 
tree which has already been searched.

<TABLE CELLPADDING=5 WIDTH="100%" BGCOLOR="#00f0f0" CELLSPACING=4>
<TR><TD WIDTH=50%>
Appendices: <A HREF="ANSI_C.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/ANSI_C.html">A ANSI C</A></TD>
<TD>Back to the <A HREF="ds_ToC.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/ds_ToC.html">Table of Contents</A>
</TD></TR></TABLE>
<SMALL>
&copy; <A HREF=mailto:morris@ee.uwa.edu.au>John Morris</A>, 1998
</SMALL>
</BODY>
</HTML>

games.html - 源码说明

本页面展示了「Data Structure Ebook」中的 games.html 源码文件，采用 HTML 编程语言编写，共 64 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与Structure相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C

搜索代码Ctrl + F

全屏模式F11

增大字号Ctrl + =

减小字号Ctrl + -

显示快捷键?