Hi.
Please can anyone help me!?
I need to make this program whith graphs, alfa-beta algoritm and an heuristic function. It's a game with a mapa and 2 players. The mapa have in every node of the graph a treasure from 0 to 99. And the ways between node have a cust from 0 (no way-player can't go throught that way) and 9. Each player can make 1 move in their turn, they can be in a node both at the same time.
So what do a need is someone who knows something about min-max algoritm and heuristic functions. That can help me to find the best heurist function to this game.
Any ideas will be very helpfull.
Thank you.
PS:Sorry if i not express my self very well i'm not english.
If it's something you would like to know more to try to help me please contact me.
Sofia



LinkBack URL
About LinkBacks



