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-01 20:09:11 PST From: =?iso-8859-1?q?=22M=E5rten?= Woxberg" Newsgroups: comp.lang.ada Subject: Re: Game algorithm Date: Sat, 02 Nov 2002 05:08:35 +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 1036210114 15034 130.236.212.27 (2 Nov 2002 04:08:34 GMT) X-Complaints-To: abuse@island.liu.se NNTP-Posting-Date: Sat, 2 Nov 2002 04:08:34 +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!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed.icl.net!newsfeed.fjserv.net!proxad.net!news.tiscali.fr!deine.net!skynet.be!skynet.be!newsfeed1.funet.fi!newsfeeds.funet.fi!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:30304 Date: 2002-11-02T05:08:35+01:00 List-Id: On Thu, 31 Oct 2002 20:54:01 +0000, John wrote: > 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. You'll have to be more specific than that.. if the tree is binary you can only move forwards or backwards.. You want a tree with at least 4 children to each node. Just store left, right, up, down lefts children would be left, right, up, down. Which strikes me as odd since left then right would be totaly strange thus you'd not want to check that... gaah.. Im to tired I shouldn't even be answering... > Could somebody direct me to a good link for this type of problem. Use google and search for Minmax: http://www.google.com/search?hl=en&lr=&ie=ISO-8859-1&q=Minmax+algorithm > Thank you Np /M�rten