Message-ID:	<19990616175204.75936.qmail@hotmail.com>
X-Originating-IP:	[132.166.132.214]
From:	QUERCY Vincent <quercy_v AT hotmail DOT com>
To:	djgpp AT delorie DOT com
Subject:	Re: Couple of questions....
Date:	Wed, 16 Jun 1999 17:52:04 GMT
Mime-Version:	1.0
Reply-To:	djgpp AT delorie DOT com

>I have questions about Djgpp:
>How can I make a reasonable pathfinder, which goes through the >shortest 
>course?
>Is there any good AI applications or games for  Djgpp?(with source >codes)
>How can I make good AI computer opponent for strategy game?
>This would really help my future projects.

I don't know were you can find exemples.
But if you want a real quick pathfinder you first need to make asm to travel 
in the possibilities tree: then you will be faster...
However, the method you will use depend a lot on what you want to do... 
There's a lot of different algorythms to research in trees.
First you must settle an evluation algorythm to make a valor of a position 
in the tree. Then you may guide your looking for program with "the greater 
solution" in each step of the tree. Easy but not efficient generally... You 
could do this and plus explorate some random solutions: it can help you to 
find greater solutions, unsuspected. You can also use more difficult 
algorythm like genetic algorythm, "recuit" algorythm, etc...
Don't have time to explain them here...


______________________________________________________
Get Your Private, Free Email at http://www.hotmail.com

- Raw text -