Relaxed problems A problem with fewer restrictions on the actions is called a relaxed problem The cost of an optimal solution to a relaxed problem is an admissible heuristic for the original problem If the rules of the 8-puzzle are relaxed so that a tile can move anywhere, then h 1 (n) gives the shortest solution If the rules are relaxed so that a tile can move to any adjacent square, then h 2 (n) gives the shortest solution
{"Image DocumentName": "Relaxed problemsA problem with fewer restrictions on the actions is called a relaxed problem.", "Image ImageDescription": "The cost of an optimal solution to a relaxed problem is an admissible heuristic for the original problem. If the rules of the 8-puzzle are relaxed so that a tile can move anywhere, then h1(n) gives the shortest solution. If the rules are relaxed so that a tile can move to any adjacent square, then h2(n) gives the shortest solution.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}