i want to design an algorithm using A* and Hill climbing alghorithms:
problem:
we have 2 agents in helix 4*4, both mobile and first agent is
following second agent. Authorized movements for agents is right,
left, up and down. agents can walk 1that towards must determined by 2
mentioned strategies. Both agents have to be moved at any step.
For hill climbing, consider a Heuristic function and once regardless
if this function implementation
[ comp.ai is moderated ... your article may take a while to appear. ]