...make generalized 8 puzzle program using Turbo Prolog...

FAQS.ORG makes no guarantees as to the accuracy of the posts. Each post is the personal opinion of the poster. These posts are not intended to substitute for medical, tax, legal, investment, accounting, or other professional advice. FAQS.ORG does not endorse any opinion or any product or service mentioned mentioned in these posts.

<< Back to general questions

[ Home | FAQ-Related Q&As | General Q&As | Answered Questions ]

Question by krucks
Submitted on 12/5/2003
Related FAQ: N/A
Rating:	Rate this question:
How to make generalized 8 puzzle program using Turbo Prolog ?

Answer by mya
Submitted on 4/14/2004
Rating:	Rate this answer:
hallo

Answer by emr
Submitted on 9/19/2004
Rating: Not yet rated	Rate this answer:
mujib

Answer by Boneco
Submitted on 4/5/2005
Rating: Not yet rated	Rate this answer:
I think it is most likely that the only thing that could possibly be generic is the syntax and semantics of the predicates you write. BUT! the implementation of the predicates has to variate pending on the nature of the nodes in your graph. Because the first thing to notice is that 8-puzzle is a graph problem where every node has to be the result of applying an operation (move the tile left from the vacuum into the vacuum, etc) to a previous state. I recommend starting by writing an implementation of some graph search algorithm, preferably A* (there is also DFS, BFS, Dijkstra, among others). Good luck!!! Miguelangel Fernandez.

Answer by masta
Submitted on 4/5/2007
Rating: Not yet rated	Rate this answer:
halla back play on playa

Your name or nickname:
If you'd like to create a new account or access your existing account, put in your password here:
Your answer: