Title Details: | |
Exercise 10: Search Algorithms II |
|
Authors: |
Sgarbas, Kyriakos |
Description: | |
Abstract: |
In this exercise, the algorithms of Exercise 9 are used to solve problems other than routing on the road map. Emphasis is placed on IDS as it finds optimal solutions without high memory requirements. By changing the successor function, the following problems are solved: the towers of Hanoi problem, the farmer's boat problem and the 8-tile puzzle. The problems are presented with various parameters in order to display the memory and execution time limits of each algorithm.
|
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/13281 |
Bibliographic Reference: | Sgarbas, K. (2024). Exercise 10: Search Algorithms II [Chapter]. In Sgarbas, K. 2024. Artificial Intelligence Laboratory Exercises with the Prolog Language [Laboratory Guide]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/13281 |
Language: |
Greek |
Is Part of: |
Artificial Intelligence Laboratory Exercises with the Prolog Language |
Publication Origin: |
Kallipos, Open Academic Editions |