From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,4edf9281f371b66d X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-11-02 06:26:08 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!nntp.infostrada.it!news.mailgate.org!newsreader.mailgate.org!not-for-mail From: "John Stoneham" Newsgroups: comp.lang.ada Subject: Re: Game algorithm Date: Sat, 2 Nov 2002 08:25:23 -0600 Organization: Mailgate.ORG Server - http://www.Mailgate.ORG Sender: obijohn63@yahoo.com Message-ID: References: NNTP-Posting-Host: cpe-24-174-227-185.gt.rr.com X-Trace: newsreader.mailgate.org 1036247167 6940 24.174.227.185 (2 Nov 2002 14:26:07 GMT) X-Complaints-To: abuse@mailgate.org NNTP-Posting-Date: Sat, 2 Nov 2002 14:26:07 +0000 (UTC) X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Xref: archiver1.google.com comp.lang.ada:30307 Date: 2002-11-02T08:25:23-06:00 List-Id: "John" wrote in message news:us3njhnp968eed@corp.supernews.com... > I am doing a strategy game of "turned-base" type in Ada and I am in search > of an algorithm which builds a binary tree in wich all the leaves represents > all the possible moves for a player, at the given moment. > > Could somebody direct me to a good link for this type of problem. > > Thank you > One of the "future" projects I am planning is a chess program in Ada. Studying chess programming has been an on-and-off hobby of mine for several years, and although you may not be usisng chess as your turn-based strategy game, I believe the underlying principles will remain the same. First look at www.cs.ualberta.ca/~tony/ICCA/anatomy.html for a very brief description of how a computer chess program "thinks". There are two algorithms enjoying dominance right now, one is called NegaScout, and the other is MTD(f). C-code for NegaScout is available at www.zib.de/reinefeld/nsc.html, and pseudo-code with an analysis for MTD(f) is at www.cs.vu.nl/~aske/mtdf.html. A good links page for computer chess programming is at www.xs4all.nl/~verhelst/chess/programming.html. I also highly recommend the book Chess Skill In Man And Machine, which you will probably need to find used somewhere like www.abebooks.com. Although dated (it doesn't describe the more recent algorithms I mentioned above), the basic descriptions of chess programs are very good. I still refer to it when I want a "refresher". Hope this helps. -- John Stoneham (to email, reverse the domain)