Bài tập trí tuệ nhân tạo heuristic search

TRƯỜNG ĐAỊ HOC
̣ BACH
́
KHOA TP.HCM
Khoa Khoa hoc̣ & Kỹ thuâṭ Maý tinh
́

ARTIFICIAL INTELLIGENCE
LAB SESSION 3
HEURISTIC SEARCH
1. OBJECTIVE
Practicing on hill-climbing & A-star search algorithm.
2. 8-PUZZLE PROBLEM
We consider the problem formalization on Lab 2 as well as its Prolog code.
3. REQUIREMENT
3.1 Give the plausible heuristic function f(n) = g(n) + h(n) (see A-star lecture note) to evaluate a
state.
3.2 Modifying search.pl as well as setting.pl to implementing:
a. Simple hill-climbing (use h(n) only)
b. Steepest ascent hill-climbing (use h(n) only)
c. A-star algorithm. (use f(n) )
4. SUBMISSION
Students are required to submit the code of question 3.2 to TA and explain the question 3.1 for TA on
class.
~END~

1
CuuDuongThanCong.com

/>