What is the time and space complexity of different search algorithms (BFS, DFS, UCS, IDS, BDS) to solve 8-puzzle game ?
05 Mar '13, 04:19
Once you sign in you will be able to subscribe for any updates here
Q&A Editor Basics
[meta] Please do not answer questions about the final exam
[closed] Final 1 Optimal Number of Steps
[closed] Final Question 9 #3: Language clarification request
[closed] final-12 visiting cell rules
There is nothing wrong with answering incorrectly if you don't know/understand the answer!
[closed] Is the cost of turning left is always the same?
[closed] Leaf node value range
[closed] PDF might contain clarification
[closed] final-3 Clarification: will more data come from the same noisy source?
[closed] Final 7- Dont you need to know the number of particiles?
powered by OSQA
First time here? Check out the FAQ!