Adobe PDF
(382.97 kB)
| Title Details: | |
|
Exercise 11: Search Algorithms III |
|
| Authors: |
Sgarbas, Kyriakos |
| Description: | |
| Abstract: |
In this exercise, the informed search algorithms BestFS (best-first search) and A* are implemented in Prolog and compared to IDS on the most difficult problem we have seen so far, the 8-Tile problem of Exercise 10. Emphasis is placed on how to construct heuristic functions to ensure the correct operation of A*. Finally, the solution of an even more difficult problem, the Rubik's Cube, is attempted with IDS and A* and the results are compared.
|
| Linguistic Editors: |
Sarafidis, Michail |
| Technical Editors: |
Papadogonas, Ioannis |
| Type: |
Chapter |
| Creation Date: | 02-05-2024 |
| Item Details: | |
| License: |
Attribution - NonCommercial - ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| Handle | http://hdl.handle.net/11419/13282 |
| Bibliographic Reference: | Sgarbas, K. (2024). Exercise 11: Search Algorithms III [Chapter]. In Sgarbas, K. 2024. Artificial Intelligence Laboratory Exercises with the Prolog Language [Laboratory Guide]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/13282 |
| Language: |
Greek |
| Is Part of: |
Artificial Intelligence Laboratory Exercises with the Prolog Language |
| Publication Origin: |
Kallipos, Open Academic Editions |