Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Towers of Hanoi Issue (Computational Explosion) #2

Closed
MFaisalZaki opened this issue Jul 17, 2020 · 2 comments
Closed

Towers of Hanoi Issue (Computational Explosion) #2

MFaisalZaki opened this issue Jul 17, 2020 · 2 comments

Comments

@MFaisalZaki
Copy link

Hello, I'm trying to solve the towers of hanoi using PDDL is works fine with 3 and 4 disks count. However, when I increase the disks count it fails and generates a nothing plan.

I'm attaching both the problem domain and instance.

Can you help me fix this issue?
Archive.zip

@ztangent
Copy link
Owner

Did you manage to solve this? It's possibly an issue with the planner timing out when it reaches the maximum number of nodes. I've recently added support for a backward chaining planner (`BackwardPlanner'), which may be able to solve some problems that forward chaining can't.

@MFaisalZaki
Copy link
Author

Yes, I had to add more facts to show that disk A is the smallest followed by disk B and so on.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants