Rule Based Planning for Solving Hanoi Problem
In this research, the planning intelligence technique has been developed and applied to solve the tower of Hanoi puzzle through the construction of the rule based included a set of facts and rules under certain conditions to describe this problem. The tower problem of Hanoi consists of different si...
Main Author: | |
---|---|
Format: | Article |
Language: | Arabic |
Published: |
Mosul University
2013-12-01
|
Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
Subjects: | |
Online Access: | https://csmj.mosuljournals.com/article_163546_ce3d1a90345cdd7569b7bfeb334a7b05.pdf |
id |
doaj-cb5a0b63b3c2432d8a2ece03a62bf74a |
---|---|
record_format |
Article |
spelling |
doaj-cb5a0b63b3c2432d8a2ece03a62bf74a2020-11-25T03:59:45ZaraMosul UniversityAl-Rafidain Journal of Computer Sciences and Mathematics 1815-48162311-79902013-12-01104515910.33899/csmj.2013.163546163546Rule Based Planning for Solving Hanoi Problemsafwan hasoon0College of Computer Sciences and Mathematics University of Mosul, Mosul, IraqIn this research, the planning intelligence technique has been developed and applied to solve the tower of Hanoi puzzle through the construction of the rule based included a set of facts and rules under certain conditions to describe this problem. The tower problem of Hanoi consists of different size disks and three pegs. The proposed system is to transfer the disks from the initial state to the goal state by using some rules. The rule based is used from planning to get the goal by applying different operations. The intelligence techniques used are contributed to reduce time and memory (state space) compared with traditional planning depended on human aid which spends more time and memory, since this technique solved a problem in the depended are planning the approach without human aid. The prolog language is used to implement the computer simulation program for the proposed system.https://csmj.mosuljournals.com/article_163546_ce3d1a90345cdd7569b7bfeb334a7b05.pdfplanningartificial intelligencehanoi puzzle |
collection |
DOAJ |
language |
Arabic |
format |
Article |
sources |
DOAJ |
author |
safwan hasoon |
spellingShingle |
safwan hasoon Rule Based Planning for Solving Hanoi Problem Al-Rafidain Journal of Computer Sciences and Mathematics planning artificial intelligence hanoi puzzle |
author_facet |
safwan hasoon |
author_sort |
safwan hasoon |
title |
Rule Based Planning for Solving Hanoi Problem |
title_short |
Rule Based Planning for Solving Hanoi Problem |
title_full |
Rule Based Planning for Solving Hanoi Problem |
title_fullStr |
Rule Based Planning for Solving Hanoi Problem |
title_full_unstemmed |
Rule Based Planning for Solving Hanoi Problem |
title_sort |
rule based planning for solving hanoi problem |
publisher |
Mosul University |
series |
Al-Rafidain Journal of Computer Sciences and Mathematics |
issn |
1815-4816 2311-7990 |
publishDate |
2013-12-01 |
description |
In this research, the planning intelligence technique has been developed and applied to solve the tower of Hanoi puzzle through the construction of the rule based included a set of facts and rules under certain conditions to describe this problem. The tower problem of Hanoi consists of different size disks and three pegs. The proposed system is to transfer the disks from the initial state to the goal state by using some rules. The rule based is used from planning to get the goal by applying different operations. The intelligence techniques used are contributed to reduce time and memory (state space) compared with traditional planning depended on human aid which spends more time and memory, since this technique solved a problem in the depended are planning the approach without human aid. The prolog language is used to implement the computer simulation program for the proposed system. |
topic |
planning artificial intelligence hanoi puzzle |
url |
https://csmj.mosuljournals.com/article_163546_ce3d1a90345cdd7569b7bfeb334a7b05.pdf |
work_keys_str_mv |
AT safwanhasoon rulebasedplanningforsolvinghanoiproblem |
_version_ |
1724453061759336448 |