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
Does the goal node need to be expanded?
A* explainaions [Non-question]
Brainstorm for line follower Robot
14-15: Why doesn't it matter whether player 1 raises or checks w/an ace?
Does anybody understand what he said?
There exists (at least) one game in which every equilibrium point is Pareto outcome. True[ ] False[ ]
Discuss, How would it work if we actualy tried to apply a probability distribution?
Pareto optimal different from equilibrium point
clarification on chance node
Getting started is easy:
If you just want to browse questions related to your course, follow the links below:
Building a Search Engine
Programming a Robotic Car
Software as a Service
Design & Analysis of Algorithms
Circuits and Electronics
Intro to Machine Learning
Probabilistic Graphical Models
Natural Language Processing
Human Computer Interaction
Web Application Engineering
Learning from Data
Introduction to Logic
Intro to Artificial Intelligence
The Lean Launchpad
First time here? Check out the FAQ!