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,XPRIO autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4edf9281f371b66d,start
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-10-31 17:54:14 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!headwall.stanford.edu!newsfeed.news2me.com!newsfeed-west.nntpserver.com!hub1.meganetnews.com!nntpserver.com!telocity-west!TELOCITY!sn-xit-03!sn-xit-06!sn-post-01!supernews.com!corp.supernews.com!not-for-mail
From: "John" <celineg@look.ca>
Newsgroups: comp.lang.ada
Subject: Game algorithm
Date: Thu, 31 Oct 2002 20:54:01 -0800
Organization: Posted via Supernews, http://www.supernews.com
Message-ID: <us3njhnp968eed@corp.supernews.com>
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 5.50.4522.1200
X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4522.1200
X-Complaints-To: abuse@supernews.com
Xref: archiver1.google.com comp.lang.ada:30272
Date: 2002-10-31T20:54:01-08:00
List-Id: <comp.lang.ada>

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