Advertisement

A Start Search

Started by October 20, 2005 06:07 AM
2 comments, last by d000hg 19 years, 3 months ago
How can one find out a heuristic function in a closed fully connected graph search in A* method with 9 vertices? Two agents are playing the game and each have three coins. The win will be, if one can create a straight line. Thx, Indraneel
Welcome to GDNet.

This sounds like homework. Is it?
[s]--------------------------------------------------------[/s]chromecode.com - software with source code
Advertisement
thas true...
but since i am new in the avenue, i need some guidance..
I need ur help
How about, play the game a bit and see what strategy you use. Then find a way to turn this into a function of the state.

This topic is closed to new replies.

Advertisement