# Homework Assignment #27

## Exercises

Design an A* algorithm for the 8-puzzle in the 5 questions posed below. Assume the start state and goal state for the puzzle as shown here:

(Image Credit: Russell & Norvig)

### Question 3

Describe your path cost function $g(n)$.

### Question 4

Describe your admissible heuristic function $h(n)$. Together $g(n)$ and $h(n)$ constitute your evaluation function (like a bound function). How do you know that $h(n)$ constitutes a lower bound on future cost and is therefore admissible?