Mäkketõusu algoritm ja selle variandid kahe probleemi näitel
Date
2014
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Mäkketõusu algoritm on üks lihtsamaid tehisintellekti otsingualgoritme ja seetõttu ka tihti kasutatav. Antud töö eesmärk on Tartu Ülikoolis õpetatava tehisintellekti kursuse kuulajatele lisamaterjali loomine, mis aitaks mäkketõusu algoritmi ning selle erinevate variantide tööpõhimõtet paremini mõista. Lisaks on töö käigus loodud programm, mis 8-mängu ja 8 lipu probleemi alusel visualiseerib algoritmi tööd ning toetab seega veelgi teemast arusaamist.
Töö sisaldab ka ülevaadet loodud programmi abil kogutud statistikast, mis võiks aidata mäkketõusu algoritmi erinevaid variante ka omavahel võrrelda.
Hill climbing algorithm is one of the searching algorithms in artificial intelligence. It is often used because of its simplicity. The goal of this thesis is to produce materials that could aid students taking artificial intelligence course to better understand the concept of hill climbing algorithm. In addition, a program was written that visualizes the use of hill climbing algorithm on the example of 8-puzzle and 8 queens problem. The program should further support the understanding of the given topic. Statistics collected with the program is used to compare the different versions of hill climbing algorithm and bring out the strengths and weaknesses of the algorithms used.
Hill climbing algorithm is one of the searching algorithms in artificial intelligence. It is often used because of its simplicity. The goal of this thesis is to produce materials that could aid students taking artificial intelligence course to better understand the concept of hill climbing algorithm. In addition, a program was written that visualizes the use of hill climbing algorithm on the example of 8-puzzle and 8 queens problem. The program should further support the understanding of the given topic. Statistics collected with the program is used to compare the different versions of hill climbing algorithm and bring out the strengths and weaknesses of the algorithms used.