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?

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.