NTU-AI-HW1/test_cases/q6/corner_sanity_1.solution
2024-03-20 00:56:22 +08:00

8 lines
238 B
Plaintext

# In order for a heuristic to be admissible, the value
# of the heuristic must be less at each state than the
# true cost of the optimal path from that state to a goal.
cost: "8"
path: """
North South South East East East North North
"""