From: "John" <celineg@look.ca>
Subject: Game algorithm
Date: Thu, 31 Oct 2002 20:54:01 -0800
Date: 2002-10-31T20:54:01-08:00 [thread overview]
Message-ID: <us3njhnp968eed@corp.supernews.com> (raw)
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
next reply other threads:[~2002-11-01 4:54 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
2002-11-01 4:54 John [this message]
2002-11-02 4:08 ` Game algorithm
2002-11-02 14:25 ` John Stoneham
2002-11-04 15:49 `
2002-11-05 2:13 ` Steven Deller
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox