Subject: Re: Game algorithm
Date: Sat, 02 Nov 2002 05:08:35 +0100
Date: 2002-11-02T05:08:35+01:00 [thread overview]
Message-ID: <pan.2002.11.02.04.08.35.428789@student.liu.se> (raw)
In-Reply-To: us3njhnp968eed@corp.supernews.com
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
next prev parent reply other threads:[~2002-11-02 4:08 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
2002-11-01 4:54 Game algorithm John
2002-11-02 4:08 ` [this message]
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