search Space

search Space ... the final frontier
Posted by Cameron Hughes, Tracey Hughes 02:56 PM | March 4, 2009

NP/NP complete and AI-complete problems are problems with huge or even infinite search or state spaces. The search or state space is a graph (or other representation) that contains all of the possible states (including the initial and goal states of the problem) of the domain of the initial problem. An example of a huge search space is all the nodes on the Internet ...