Combinatorial search

en.wikipedia.org · 529 words · saved by 1 readers

In computer science and artificial intelligence, combinatorial search studies search algorithms for solving instances of problems that are believed to be hard in general, by efficiently exploring the usually large solution space of these instances. Combinatorial search algorithms achieve this efficiency by reducing the effective size of the search space or employing heuristics. Some algorithms are guaranteed to find the optimal solution, while others may only return the best solution found in the part of the state space that was explored.

Combinatorial search - Wikipedia Jump to content From Wikipedia, the free encyclopedia This article includes a list of references , related reading , or external links , but its sources remain unclear because it lacks inline citations . Please help improve this article by introducing more precise citations. ( January 2013 ) ( Learn how and when to remove this message ) This article relies on a single source . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed . Find sources: "Combinatorial search" – news · newspapers · bo