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 X-Google-Thread: 103376,4edf9281f371b66d X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-11-04 07:50:39 PST From: =?iso-8859-1?q?=22M=E5rten?= Woxberg" Newsgroups: comp.lang.ada Subject: Re: Game algorithm Date: Mon, 04 Nov 2002 16:49:24 +0100 Organization: Island Message-ID: References: NNTP-Posting-Host: k27.ryd.student.liu.se Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit X-Trace: news.island.liu.se 1036425026 24235 130.236.212.27 (4 Nov 2002 15:50:26 GMT) X-Complaints-To: abuse@island.liu.se NNTP-Posting-Date: Mon, 4 Nov 2002 15:50:26 +0000 (UTC) User-Agent: Pan/0.13.1 (It's always funny until somebody immanentizes the eschaton) Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!newsfeed.sunet.se!news01.sunet.se!puffinus.its.uu.se!news.Update.UU.SE!news.island.liu.se!not-for-mail Xref: archiver1.google.com comp.lang.ada:30350 Date: 2002-11-04T16:49:24+01:00 List-Id: On Sat, 02 Nov 2002 08:25:23 +0000, John Stoneham wrote: > "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. > Me and my friends did a Chessprogram in Ada for a school project. We used a weighted minmax algorithm for our two AI-clients. It was a client server aproach since we needed networking for the project. Our server could handle many games at the same time (tested with 4Gb RAM so we didnt care). AI-clients ate through 60.000 boards before doing a move. that's about 4 levels deep into the move tree. I could probaly get you the whole source (client, server and ai). We used a local package for drawing colors in Sun x-terms so that probably wont work well.. there should be a quick 'n dirty version of it too... If you want it just say so... > Hope this helps. > > -- > John Stoneham > (to email, reverse the domain) /M�rten