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 HEURISTIC SEARCH OBJECTIVE Practicing on hill-climbing & A-star search algorithm 8-PUZZLE PROBLEM We consider the problem formalization on Lab as well as its Prolog code 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) ) 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~ CuuDuongThanCong.com https://fb.com/tailieudientucntt