• PUDN用户
    了解作者
  • Visual C++
    开发工具
  • 247KB
    文件大小
  • rar
    文件格式
  • 0
    收藏次数
  • 1 积分
    下载积分
  • 20
    下载次数
  • 2010-03-16 16:23
    上传日期
蒙特卡洛算法的宝贵论文资料, 尤其应用于计算机博弈中的。
MonteCarlo.rar
  • The Basics of Monte Carlo Simulations.doc
    54.5KB
  • MONTE-CARLO GO DEVELOPMENTS.pdf
    144.7KB
  • MonteCarloGo.pdf
    153.7KB
内容介绍
<html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta charset="utf-8"> <meta name="generator" content="pdf2htmlEX"> <meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"> <link rel="stylesheet" href="https://static.pudn.com/base/css/base.min.css"> <link rel="stylesheet" href="https://static.pudn.com/base/css/fancy.min.css"> <link rel="stylesheet" href="https://static.pudn.com/prod/directory_preview_static/626703334f8811599ec593fc/raw.css"> <script src="https://static.pudn.com/base/js/compatibility.min.js"></script> <script src="https://static.pudn.com/base/js/pdf2htmlEX.min.js"></script> <script> try{ pdf2htmlEX.defaultViewer = new pdf2htmlEX.Viewer({}); }catch(e){} </script> <title></title> </head> <body> <div id="sidebar" style="display: none"> <div id="outline"> </div> </div> <div id="pf1" class="pf w0 h0" data-page-no="1"><div class="pc pc1 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="https://static.pudn.com/prod/directory_preview_static/626703334f8811599ec593fc/bg1.jpg"><div class="t m0 x1 h2 y1 ff1 fs0 fc0 sc0 ls0 ws0">Mon<span class="_ _0"></span>te<span class="_"> </span>Carlo<span class="_"> </span>Go</div><div class="t m0 x2 h3 y2 ff2 fs1 fc0 sc0 ls0 ws0">Bernd<span class="_"> </span>Br<span class="_ _1"></span>&#168;<span class="_ _2"></span>ugmann</div><div class="t m0 x3 h3 y3 ff2 fs1 fc0 sc0 ls0 ws0">Max-Planc<span class="_ _0"></span>k-Institute<span class="_ _3"> </span>of<span class="_"> </span>Ph<span class="_ _0"></span>ysics</div><div class="t m0 x2 h3 y4 ff2 fs1 fc0 sc0 ls0 ws0">F&#168;<span class="_ _2"></span>ohringer<span class="_ _3"> </span>Ring<span class="_"> </span>6</div><div class="t m0 x4 h3 y5 ff2 fs1 fc0 sc0 ls0 ws0">80805<span class="_"> </span>M<span class="_ _1"></span>&#168;<span class="_ _2"></span>unc<span class="_ _0"></span>hen,<span class="_"> </span>Germany</div><div class="t m0 x5 h3 y6 ff2 fs1 fc0 sc0 ls0 ws0">bruegman@iws170.mppm<span class="_ _0"></span>u.mpg.de</div><div class="t m0 x6 h3 y7 ff2 fs1 fc0 sc0 ls0 ws0">Octob<span class="_ _1"></span>er<span class="_"> </span>9,<span class="_"> </span>1993</div><div class="t m0 x7 h4 y8 ff3 fs1 fc0 sc0 ls0 ws0">Abstract</div><div class="t m0 x8 h5 y9 ff4 fs2 fc0 sc0 ls0 ws0">1</div><div class="t m0 x7 h6 ya ff5 fs3 fc0 sc0 ls0 ws0">W<span class="_ _4"></span>e<span class="_ _3"> </span>presen<span class="_ _0"></span>t<span class="_ _3"> </span>an<span class="_ _3"> </span>algorithm<span class="_ _3"> </span>for<span class="_ _3"> </span>the<span class="_ _3"> </span>board<span class="_ _3"> </span>game<span class="_ _3"> </span>go</div><div class="t m0 x7 h6 yb ff5 fs3 fc0 sc0 ls0 ws0">whic<span class="_ _0"></span>h<span class="_ _5"> </span>attempts<span class="_ _5"> </span>to<span class="_ _5"> </span>&#64257;nd<span class="_ _5"> </span>the<span class="_ _3"> </span>b<span class="_ _1"></span>est<span class="_ _5"> </span>mo<span class="_ _0"></span>ve<span class="_ _5"> </span>b<span class="_ _0"></span>y<span class="_ _5"> </span>sim<span class="_ _0"></span>u-</div><div class="t m0 x7 h6 yc ff5 fs3 fc0 sc0 ls0 ws0">lated<span class="_ _3"> </span>annealing.<span class="_ _6"> </span>Remark<span class="_ _0"></span>ably<span class="_ _4"></span>,<span class="_ _3"> </span>without<span class="_ _5"> </span>including</div><div class="t m0 x7 h6 yd ff5 fs3 fc0 sc0 ls0 ws0">an<span class="_ _0"></span>y<span class="_ _7"> </span>go<span class="_ _5"> </span>knowledge<span class="_ _5"> </span>b<span class="_ _1"></span>eyond<span class="_ _5"> </span>the<span class="_ _5"> </span>rules,<span class="_ _7"> </span>our<span class="_ _7"> </span>imple-</div><div class="t m0 x7 h6 ye ff5 fs3 fc0 sc0 ls0 ws0">men<span class="_ _0"></span>tation<span class="_ _8"> </span>leads<span class="_ _9"> </span>to<span class="_ _9"> </span>a<span class="_ _9"> </span>playing<span class="_ _9"> </span>strength<span class="_ _9"> </span>of<span class="_ _9"> </span>ab<span class="_ _1"></span>out<span class="_ _9"> </span>25</div><div class="t m0 x7 h6 yf ff5 fs3 fc0 sc0 ls0 ws0">kyu<span class="_"> </span>on<span class="_"> </span>a<span class="_"> </span>9x9<span class="_"> </span>b<span class="_ _1"></span>oard.</div><div class="t m0 x7 h4 y10 ff3 fs1 fc0 sc0 ls0 ws0">In<span class="_ _0"></span>tro<span class="_ _1"></span>duction</div><div class="t m0 x7 h6 y11 ff5 fs3 fc0 sc0 ls0 ws0">The<span class="_ _9"> </span>b<span class="_ _1"></span>oard<span class="_ _9"> </span>game<span class="_ _9"> </span>go<span class="_ _8"> </span>is<span class="_ _9"> </span>one<span class="_ _8"> </span>of<span class="_ _9"> </span>the<span class="_ _9"> </span>grand<span class="_ _9"> </span>challenges</div><div class="t m0 x7 h6 y12 ff5 fs3 fc0 sc0 ls0 ws0">of<span class="_ _9"> </span>game<span class="_"> </span>related<span class="_ _8"> </span>arti&#64257;cial<span class="_"> </span>in<span class="_ _0"></span>telligence.<span class="_ _7"> </span>While<span class="_ _8"> </span>go<span class="_ _8"> </span>is</div><div class="t m0 x7 h6 y13 ff5 fs3 fc0 sc0 ls0 ws0">a<span class="_ _3"> </span>&#64257;nite,<span class="_ _3"> </span>perfect<span class="_ _3"> </span>information<span class="_ _3"> </span>game,<span class="_ _3"> </span>its<span class="_ _3"> </span>game<span class="_ _a"> </span>tree</div><div class="t m0 x7 h6 y14 ff5 fs3 fc0 sc0 ls0 ws0">is<span class="_ _3"> </span>prohibitively<span class="_ _3"> </span>large<span class="_ _5"> </span>for<span class="_ _3"> </span>tree<span class="_ _5"> </span>searches.<span class="_ _6"> </span>The<span class="_ _3"> </span>sit-</div><div class="t m0 x7 h6 y15 ff5 fs3 fc0 sc0 ls0 ws0">uation<span class="_"> </span>in<span class="_ _a"> </span>go<span class="_ _a"> </span>is<span class="_"> </span>p<span class="_ _1"></span>erhaps<span class="_"> </span>b<span class="_ _1"></span>est<span class="_"> </span>compared<span class="_ _a"> </span>with<span class="_"> </span>that</div><div class="t m0 x7 h6 y16 ff5 fs3 fc0 sc0 ls0 ws0">in<span class="_ _5"> </span>c<span class="_ _0"></span>hess,<span class="_ _7"> </span>whic<span class="_ _0"></span>h<span class="_ _5"> </span>has<span class="_ _5"> </span>b<span class="_ _1"></span>een<span class="_ _5"> </span>called<span class="_ _5"> </span>&#8220;the<span class="_ _5"> </span>drosophila</div><div class="t m0 x7 h6 y17 ff5 fs3 fc0 sc0 ls0 ws0">of<span class="_ _5"> </span>arti&#64257;cial<span class="_ _5"> </span>in<span class="_ _0"></span>telligence&#8221;,<span class="_ _b"> </span>meaning<span class="_ _5"> </span>that<span class="_ _5"> </span>a<span class="_ _5"> </span>m<span class="_ _0"></span>ulti-</div><div class="t m0 x7 h6 y18 ff5 fs3 fc0 sc0 ls0 ws0">tude<span class="_"> </span>of<span class="_ _a"> </span>k<span class="_ _0"></span>ey<span class="_ _a"> </span>problems<span class="_ _a"> </span>of<span class="_ _a"> </span>arti&#64257;cial<span class="_ _a"> </span>in<span class="_ _0"></span>telligence<span class="_ _3"> </span>ap-</div><div class="t m0 x7 h6 y19 ff5 fs3 fc0 sc0 ls0 ws0">p<span class="_ _1"></span>ear<span class="_ _c"> </span>in<span class="_ _c"> </span>chess<span class="_ _c"> </span>and<span class="_ _9"> </span>can<span class="_ _c"> </span>b<span class="_ _1"></span>e<span class="_ _c"> </span>studied<span class="_ _d"> </span>there.<span class="_ _3"> </span>Currently<span class="_ _4"></span>,</div><div class="t m0 x7 h6 y1a ff5 fs3 fc0 sc0 ls0 ws0">the<span class="_ _3"> </span>b<span class="_ _1"></span>est<span class="_ _5"> </span>c<span class="_ _0"></span>hess<span class="_ _3"> </span>playing<span class="_ _3"> </span>programs<span class="_ _5"> </span>rely<span class="_ _3"> </span>hea<span class="_ _0"></span>vily<span class="_ _5"> </span>on</div><div class="t m0 x7 h6 y1b ff5 fs3 fc0 sc0 ls0 ws0">large<span class="_"> </span>scale<span class="_"> </span>tree<span class="_"> </span>searches<span class="_"> </span>and<span class="_ _8"> </span>use<span class="_"> </span>a<span class="_"> </span>comparativ<span class="_ _0"></span>ely</div><div class="t m0 x7 h6 y1c ff5 fs3 fc0 sc0 ls0 ws0">small<span class="_"> </span>amount<span class="_"> </span>of<span class="_ _a"> </span>c<span class="_ _0"></span>hess<span class="_ _a"> </span>kno<span class="_ _0"></span>wledge.<span class="_ _b"> </span>In<span class="_ _a"> </span>go<span class="_ _a"> </span>it<span class="_ _a"> </span>is<span class="_"> </span>the</div><div class="t m0 x7 h6 y1d ff5 fs3 fc0 sc0 ls0 ws0">other<span class="_ _9"> </span>wa<span class="_ _0"></span>y<span class="_ _9"> </span>round,<span class="_ _9"> </span>i.e.<span class="_ _5"> </span>the<span class="_ _8"> </span>qualit<span class="_ _0"></span>y<span class="_"> </span>of<span class="_ _9"> </span>the<span class="_ _9"> </span>go<span class="_ _8"> </span>kno<span class="_ _0"></span>wl-</div><div class="t m0 x7 h6 y1e ff5 fs3 fc0 sc0 ls0 ws0">edge<span class="_"> </span>is<span class="_"> </span>the<span class="_"> </span>determining<span class="_"> </span>factor.<span class="_ _5"> </span>Due<span class="_"> </span>to<span class="_"> </span>the<span class="_"> </span>struc-</div><div class="t m0 x7 h6 y1f ff5 fs3 fc0 sc0 ls0 ws0">ture<span class="_ _3"> </span>of<span class="_ _3"> </span>go,<span class="_ _5"> </span>strong<span class="_ _5"> </span>go<span class="_ _3"> </span>programs<span class="_ _3"> </span>emphasize<span class="_ _5"> </span>m<span class="_ _0"></span>uch</div><div class="t m0 x7 h6 y20 ff5 fs3 fc0 sc0 ls0 ws0">more<span class="_ _8"> </span>the<span class="_ _8"> </span>h<span class="_ _0"></span>uman<span class="_ _8"> </span>w<span class="_ _0"></span>ay<span class="_ _9"> </span>of<span class="_"> </span>thinking<span class="_ _8"> </span>ab<span class="_ _1"></span>out<span class="_ _9"> </span>go<span class="_"> </span>rather</div><div class="t m0 x7 h6 y21 ff5 fs3 fc0 sc0 ls0 ws0">than<span class="_ _7"> </span>brute<span class="_ _b"> </span>force<span class="_ _7"> </span>metho<span class="_ _1"></span>ds<span class="_ _b"> </span>for<span class="_ _7"> </span>which<span class="_ _7"> </span>computers</div><div class="t m0 x7 h6 y22 ff5 fs3 fc0 sc0 ls0 ws0">are<span class="_ _a"> </span>ideal,<span class="_ _5"> </span>and<span class="_ _a"> </span>from<span class="_ _3"> </span>this<span class="_ _3"> </span>p<span class="_ _1"></span>oin<span class="_ _0"></span>t<span class="_ _3"> </span>of<span class="_ _3"> </span>view<span class="_ _a"> </span>one<span class="_ _3"> </span>could</div><div class="t m0 x7 h6 y23 ff5 fs3 fc0 sc0 ls0 ws0">argue<span class="_ _5"> </span>that<span class="_ _5"> </span>go<span class="_ _5"> </span>is<span class="_ _5"> </span>a<span class="_ _5"> </span>muc<span class="_ _0"></span>h<span class="_ _5"> </span>more<span class="_ _3"> </span>interesting<span class="_ _5"> </span>prob-</div><div class="t m0 x7 h6 y24 ff5 fs3 fc0 sc0 ls0 ws0">lem<span class="_ _3"> </span>than<span class="_ _a"> </span>chess.<span class="_ _e"> </span>Man<span class="_ _0"></span>y<span class="_ _3"> </span>imp<span class="_ _1"></span>ortant<span class="_ _a"> </span>adv<span class="_ _0"></span>ances<span class="_ _3"> </span>ha<span class="_ _0"></span>ve</div><div class="t m0 x7 h6 y25 ff5 fs3 fc0 sc0 ls0 ws0">b<span class="_ _1"></span>een<span class="_ _d"> </span>made<span class="_"> </span>in<span class="_ _d"> </span>go<span class="_"> </span>regarding<span class="_ _9"> </span>the<span class="_ _9"> </span>application<span class="_"> </span>of<span class="_ _9"> </span>rule</div><div class="t m0 x9 h7 y26 ff6 fs4 fc0 sc0 ls0 ws0">1</div><div class="t m0 xa h8 y27 ff7 fs5 fc0 sc0 ls0 ws0">This<span class="_ _8"> </span>article<span class="_ _a"> </span>w<span class="_ _0"></span>as<span class="_ _8"> </span>written<span class="_ _8"> </span>with<span class="_ _a"> </span>the<span class="_"> </span>readership<span class="_ _8"> </span>of<span class="_ _f"> </span>Com-</div><div class="t m0 x7 h8 y28 ff7 fs5 fc0 sc0 ls0 ws0">puter<span class="_ _10"> </span>Go<span class="_ _10"> </span>magazine<span class="_ _c"> </span>in<span class="_ _10"> </span>mind.<span class="_ _a"> </span>Therefore<span class="_ _c"> </span>I<span class="_ _10"> </span>tried<span class="_ _10"> </span>to<span class="_ _10"> </span>emphasize</div><div class="t m0 x7 h8 y29 ff7 fs5 fc0 sc0 ls0 ws0">a<span class="_"> </span>clear<span class="_ _d"> </span>and<span class="_"> </span>complete<span class="_"> </span>dev<span class="_ _0"></span>elopment<span class="_ _c"> </span>of<span class="_"> </span>concepts<span class="_"> </span>rather<span class="_ _d"> </span>than</div><div class="t m0 x7 h8 y2a ff7 fs5 fc0 sc0 ls0 ws0">formalism.<span class="_ _3"> </span>I<span class="_"> </span>w<span class="_ _0"></span>ould<span class="_"> </span>like<span class="_ _d"> </span>to<span class="_"> </span>thank<span class="_"> </span>the<span class="_ _c"> </span>referees<span class="_ _8"> </span>of<span class="_"> </span>the<span class="_"> </span>AAAI</div><div class="t m0 x7 h8 y2b ff7 fs5 fc0 sc0 ls0 ws0">Symposium<span class="_"> </span>on<span class="_"> </span>&#8216;Games:<span class="_ _3"> </span>Playing,<span class="_"> </span>Planning,<span class="_ _8"> </span>and<span class="_"> </span>Learning&#8217;</div><div class="t m0 x7 h8 y2c ff7 fs5 fc0 sc0 ls0 ws0">(F<span class="_ _4"></span>all<span class="_ _8"> </span>1993)<span class="_"> </span>for<span class="_ _8"> </span>many<span class="_ _d"> </span>helpful<span class="_"> </span>comments.</div><div class="t m0 xb h6 y8 ff5 fs3 fc0 sc0 ls0 ws0">based<span class="_ _3"> </span>knowledge<span class="_ _3"> </span>represen<span class="_ _0"></span>tations,<span class="_ _5"> </span>pattern<span class="_ _5"> </span>recog-</div><div class="t m0 xb h6 y2d ff5 fs3 fc0 sc0 ls0 ws0">nition<span class="_ _a"> </span>and<span class="_ _a"> </span>machine<span class="_ _a"> </span>learning.<span class="_ _11"> </span>F<span class="_ _4"></span>or<span class="_ _a"> </span>a<span class="_ _a"> </span>recent,<span class="_ _a"> </span>lucid</div><div class="t m0 xb h6 y2e ff5 fs3 fc0 sc0 ls0 ws0">review<span class="_ _5"> </span>of<span class="_ _5"> </span>computer<span class="_ _5"> </span>go<span class="_ _5"> </span>see<span class="_ _7"> </span>[1].<span class="_ _12"> </span>Sev<span class="_ _0"></span>eral<span class="_ _5"> </span>relev<span class="_ _0"></span>ant</div><div class="t m0 xb h6 y2f ff5 fs3 fc0 sc0 ls0 ws0">pap<span class="_ _1"></span>ers<span class="_"> </span>on<span class="_"> </span>computer<span class="_"> </span>go<span class="_"> </span>are<span class="_"> </span>collected<span class="_ _a"> </span>in<span class="_"> </span>[2].</div><div class="t m0 xc h6 y30 ff5 fs3 fc0 sc0 ls0 ws0">In<span class="_ _c"> </span>this<span class="_ _c"> </span>article<span class="_ _d"> </span>we<span class="_ _c"> </span>w<span class="_ _0"></span>an<span class="_ _0"></span>t<span class="_ _d"> </span>to<span class="_ _c"> </span>lo<span class="_ _1"></span>ok<span class="_ _d"> </span>at<span class="_ _d"> </span>go<span class="_ _c"> </span>from<span class="_ _d"> </span>a<span class="_ _c"> </span>com-</div><div class="t m0 xb h6 y31 ff5 fs3 fc0 sc0 ls0 ws0">pletely<span class="_ _b"> </span>di&#64256;erent<span class="_ _7"> </span>angle:<span class="_ _12"> </span><span class="ff8">How<span class="_ _b"> </span>would<span class="_ _11"> </span>natur<span class="_ _4"></span>e<span class="_ _b"> </span>play</span></div><div class="t m0 xb h6 y32 ff8 fs3 fc0 sc0 ls0 ws0">go<span class="ff5">?<span class="_ _5"> </span>This<span class="_ _8"> </span>is<span class="_ _8"> </span>not<span class="_"> </span>the<span class="_ _8"> </span>starting<span class="_"> </span>point<span class="_ _9"> </span>of<span class="_"> </span>a<span class="_"> </span>metaph<span class="_ _0"></span>ys-</span></div><div class="t m0 xb h6 y33 ff5 fs3 fc0 sc0 ls0 ws0">ical<span class="_ _a"> </span>discussion.<span class="_ _7"> </span>This<span class="_"> </span>is<span class="_ _a"> </span>an<span class="_ _a"> </span>attempt<span class="_"> </span>to<span class="_ _a"> </span>learn<span class="_ _a"> </span>from</div><div class="t m0 xb h6 y34 ff5 fs3 fc0 sc0 ls0 ws0">ph<span class="_ _0"></span>ysics<span class="_ _b"> </span>ab<span class="_ _1"></span>out<span class="_ _b"> </span>a<span class="_ _b"> </span>metho<span class="_ _1"></span>d<span class="_ _7"> </span>of<span class="_ _13"> </span>optimization<span class="_ _b"> </span>which</div><div class="t m0 xb h6 y35 ff5 fs3 fc0 sc0 ls0 ws0">nature<span class="_"> </span>applies<span class="_ _a"> </span>v<span class="_ _0"></span>ery<span class="_ _a"> </span>successfully<span class="_"> </span>and<span class="_ _f"> </span>&#8220;naturally&#8221;.</div><div class="t m0 xb h6 y36 ff5 fs3 fc0 sc0 ls0 ws0">W<span class="_ _4"></span>e<span class="_ _a"> </span>will<span class="_"> </span>consider<span class="_ _a"> </span>sim<span class="_ _0"></span>ulated<span class="_ _a"> </span>annealing<span class="_ _a"> </span>[3,<span class="_ _a"> </span>4,<span class="_"> </span>5<span class="_ _1"></span>,<span class="_"> </span>6],</div><div class="t m0 xb h6 y37 ff5 fs3 fc0 sc0 ls0 ws0">whic<span class="_ _0"></span>h<span class="_ _b"> </span>under<span class="_ _7"> </span>surprisingly<span class="_ _b"> </span>general<span class="_ _b"> </span>circumstances</div><div class="t m0 xb h6 y38 ff5 fs3 fc0 sc0 ls0 ws0">is<span class="_ _a"> </span>able<span class="_ _a"> </span>to<span class="_ _3"> </span>&#64257;nd<span class="_ _a"> </span>appro<span class="_ _0"></span>ximations<span class="_ _3"> </span>to<span class="_ _a"> </span>the<span class="_ _a"> </span>extrema<span class="_ _3"> </span>of</div><div class="t m0 xb h6 y39 ff5 fs3 fc0 sc0 ls0 ws0">a<span class="_ _3"> </span>mathematical<span class="_ _5"> </span>function.<span class="_ _6"> </span>Our<span class="_ _3"> </span>topic<span class="_ _5"> </span>will<span class="_ _3"> </span>b<span class="_ _1"></span>e<span class="_ _5"> </span>the</div><div class="t m0 xb h6 y3a ff5 fs3 fc0 sc0 ls0 ws0">question<span class="_ _9"> </span>of<span class="_ _9"> </span>how<span class="_ _9"> </span>to<span class="_ _9"> </span>formulate<span class="_ _9"> </span>the<span class="_ _9"> </span>task<span class="_ _8"> </span>of<span class="_ _9"> </span>&#64257;nding<span class="_ _9"> </span>a</div><div class="t m0 xb h6 y3b ff5 fs3 fc0 sc0 ls0 ws0">go<span class="_ _1"></span>o<span class="_ _1"></span>d<span class="_ _c"> </span>mov<span class="_ _0"></span>e<span class="_ _d"> </span>as<span class="_ _d"> </span>a<span class="_ _d"> </span>problem<span class="_ _d"> </span>in<span class="_ _d"> </span>extremization<span class="_ _9"> </span>which<span class="_ _c"> </span>is</div><div class="t m0 xb h6 y3c ff5 fs3 fc0 sc0 ls0 ws0">tailored<span class="_"> </span>to<span class="_ _a"> </span>the<span class="_"> </span>strengths<span class="_"> </span>of<span class="_"> </span>sim<span class="_ _0"></span>ulated<span class="_"> </span>annealing.</div><div class="t m0 xc h6 y3d ff5 fs3 fc0 sc0 ls0 ws0">P<span class="_ _0"></span>erhaps<span class="_ _3"> </span>it<span class="_ _3"> </span>is<span class="_ _3"> </span>w<span class="_ _0"></span>orthwhile<span class="_ _a"> </span>to<span class="_ _3"> </span>describ<span class="_ _1"></span>e<span class="_ _3"> </span>the<span class="_ _a"> </span>main</div><div class="t m0 xb h6 y3e ff5 fs3 fc0 sc0 ls0 ws0">idea<span class="_ _a"> </span>right<span class="_ _a"> </span>aw<span class="_ _0"></span>a<span class="_ _0"></span>y<span class="_ _3"> </span>in<span class="_ _a"> </span>very<span class="_ _a"> </span>simple<span class="_ _a"> </span>terms<span class="_ _3"> </span>to<span class="_ _a"> </span>indicate</div><div class="t m0 xb h6 y3f ff5 fs3 fc0 sc0 ls0 ws0">the<span class="_ _b"> </span>direction<span class="_ _b"> </span>in<span class="_ _b"> </span>which<span class="_ _7"> </span>we<span class="_ _b"> </span>are<span class="_ _b"> </span>heading.<span class="_ _14"> </span>There</div><div class="t m0 xb h6 y40 ff5 fs3 fc0 sc0 ls0 ws0">are<span class="_ _8"> </span>essen<span class="_ _0"></span>tially<span class="_"> </span>three<span class="_"> </span>ingredien<span class="_ _0"></span>ts<span class="_ _8"> </span>in<span class="_ _9"> </span>computer<span class="_"> </span>pro-</div><div class="t m0 xb h6 y41 ff5 fs3 fc0 sc0 ls0 ws0">grams<span class="_ _3"> </span>for<span class="_ _5"> </span>pla<span class="_ _0"></span>ying<span class="_ _5"> </span>games<span class="_ _3"> </span>like<span class="_ _5"> </span>go:<span class="_ _e"> </span>(i)<span class="_ _3"> </span>lo<span class="_ _1"></span>ok-ahead</div><div class="t m0 xb h6 y42 ff5 fs3 fc0 sc0 ls0 ws0">where<span class="_"> </span>di&#64256;erent<span class="_"> </span>sequences<span class="_ _a"> </span>of<span class="_ _a"> </span>mo<span class="_ _0"></span>ves<span class="_"> </span>are<span class="_ _a"> </span>tried,<span class="_ _a"> </span>(ii)</div><div class="t m0 xb h6 y43 ff5 fs3 fc0 sc0 ls0 ws0">ev<span class="_ _0"></span>aluation<span class="_ _3"> </span>where<span class="_ _a"> </span>the<span class="_ _3"> </span>v<span class="_ _0"></span>alue<span class="_ _a"> </span>of<span class="_ _3"> </span>a<span class="_ _3"> </span>p<span class="_ _1"></span>osition<span class="_ _3"> </span>is<span class="_ _a"> </span>com-</div><div class="t m0 xb h6 y44 ff5 fs3 fc0 sc0 ls0 ws0">puted<span class="_ _3"> </span>without<span class="_ _5"> </span>explicitly<span class="_ _5"> </span>performing<span class="_ _5"> </span>mo<span class="_ _0"></span>v<span class="_ _0"></span>es,<span class="_ _7"> </span>and</div><div class="t m0 xb h6 y45 ff5 fs3 fc0 sc0 ls0 ws0">(iii)<span class="_ _b"> </span>an<span class="_ _7"> </span>ov<span class="_ _0"></span>erall<span class="_ _b"> </span>scheme<span class="_ _7"> </span>for<span class="_ _7"> </span>how<span class="_ _7"> </span>(i)<span class="_ _b"> </span>and<span class="_ _7"> </span>(ii)<span class="_ _b"> </span>are</div><div class="t m0 xb h6 y46 ff5 fs3 fc0 sc0 ls0 ws0">com<span class="_ _0"></span>bined.<span class="_ _5"> </span>Here<span class="_ _a"> </span>is<span class="_"> </span>our<span class="_"> </span>prop<span class="_ _1"></span>osal:</div><div class="t m0 xd h6 y47 ff5 fs3 fc0 sc0 ls0 ws0">(i)<span class="_ _a"> </span>mo<span class="_ _0"></span>ves<span class="_"> </span>are<span class="_ _a"> </span>p<span class="_ _1"></span>erformed<span class="_"> </span>randomly<span class="_"> </span>with</div><div class="t m0 xe h6 y48 ff5 fs3 fc0 sc0 ls0 ws0">probabilities<span class="_ _9"> </span>assigned<span class="_ _d"> </span>by<span class="_ _c"> </span>the<span class="_ _9"> </span>metho<span class="_ _1"></span>d</div><div class="t m0 xe h6 y49 ff5 fs3 fc0 sc0 ls0 ws0">of<span class="_"> </span>sim<span class="_ _0"></span>ulated<span class="_ _a"> </span>annealing,</div><div class="t m0 xd h6 y4a ff5 fs3 fc0 sc0 ls0 ws0">(ii)<span class="_ _a"> </span>the<span class="_"> </span>v<span class="_ _0"></span>alue<span class="_ _a"> </span>of<span class="_ _a"> </span>a<span class="_ _a"> </span>p<span class="_ _1"></span>osition<span class="_"> </span>in<span class="_"> </span>which<span class="_"> </span>the</div><div class="t m0 xe h6 y4b ff5 fs3 fc0 sc0 ls0 ws0">game<span class="_ _a"> </span>is<span class="_ _a"> </span>ov<span class="_ _0"></span>er<span class="_ _a"> </span>is<span class="_ _a"> </span>de&#64257;ned<span class="_ _a"> </span>by<span class="_"> </span>coun<span class="_ _0"></span>ting,</div><div class="t m0 xe h6 y4c ff5 fs3 fc0 sc0 ls0 ws0">and</div><div class="t m0 xd h6 y4d ff5 fs3 fc0 sc0 ls0 ws0">(iii)<span class="_ _8"> </span>to<span class="_ _8"> </span>&#64257;nd<span class="_ _9"> </span>the<span class="_ _8"> </span>b<span class="_ _1"></span>est<span class="_ _9"> </span>mov<span class="_ _0"></span>e<span class="_ _8"> </span>in<span class="_ _9"> </span>a<span class="_"> </span>giv<span class="_ _0"></span>en<span class="_"> </span>po-</div><div class="t m0 xe h6 y4e ff5 fs3 fc0 sc0 ls0 ws0">sition<span class="_"> </span>pla<span class="_ _0"></span>y<span class="_"> </span>the<span class="_"> </span>game<span class="_"> </span>to<span class="_ _8"> </span>the<span class="_"> </span>v<span class="_ _0"></span>ery<span class="_"> </span>end</div><div class="t m0 xe h6 y2c ff5 fs3 fc0 sc0 ls0 ws0">as<span class="_ _3"> </span>suggested<span class="_ _5"> </span>by<span class="_ _3"> </span>(i)<span class="_ _5"> </span>and<span class="_ _3"> </span>then<span class="_ _3"> </span>ev<span class="_ _0"></span>alu-</div><div class="t m0 xf h6 y4f ff5 fs3 fc0 sc0 ls0 ws0">1</div></div><div class="pi" data-data='{"ctm":[1.889972,0.000000,0.000000,1.889972,-109.618384,-139.857939]}'></div></div> </body> </html>
评论
    相关推荐
    • linux内核源代码情景分析(上下目录全).rar
      经过本人加全目录的《LINUX内核源代码情景分析(浙大出版)》上下册,毛德操、胡希明著,总共50兆,1500页,原PDF书籍目录不全,阅读很不方便,经过本人一番努力,将目录整理加入,希望广大读者阅读能更方便一些。
    • 标准C语言实用全书_10440499.rar
      标准C语言实用全书,对C语言的复杂性和核心特征进行了详细的论述。
    • Tcl_train.rar
      tcl脚本语言教程(pdf格式)。适合入门学习使用。
    • HOG.rar
      HOG的详细介绍和源代码,以及附带详细PPT介绍,对学习HOG很有帮助
    • 移动短信SMS综合资料库.rar
      短消息基础知识;短消息的信息处理流程及其分析、解决问题的方法;手机短信息SMS开发—编码,解码;PDU介绍;短消息的体系结构等
    • ourdev_350270.rar
      天祥公司的msp430LT-1B的详细资料
    • iso7816.rar
      ISO 7816协议,sim卡相关标准.ISO7816-1-2-3的完全中文版.pdf,国际标准化组织IC卡标准中文版ISO7816-4.pdf
    • Matlab 6.0图形图像处理函数命令及详细列表.rar
      Matlab 6.0图形图像处理函数命令及详细列表的PDF版
    • ASP自编常用函数.rar
      较为详细的介绍了asp自定义的各种函数,方便asp的各种开发.
    • Effective STL 中文版(完整版).rar
      制作本书的目的是为了方便大家的阅读。转载时请保持本电子书的完整性。 前言、条款2、16、21、44根据从Addison-Wesley出版社下载的开放条款翻译。条款26、27、28、45根据从Scott Meyers的网站下载的《Three Guidelines for Effective Iterator Usage》一文翻译。条款43根据从C/C++ Users Journal网站下载的《STL Algorithms vs. Hand-Written Loops》一文翻译,条款45根据从C/C++ Users Journal网站下载的《Distinguishing STL Search Algorithms》一文翻译。其余部分根据epubcn放出的电子书制作。