

Introduction of Searching

Search, a technique that enumerates the state space, finds the optimal solution or counts the number of legal solutions by exhausting all the possibilities.

There are many ways to optimize search, such as reducing the state space, changing the search order, pruning, etc.

Search is the basis of some advanced algorithms. In OI, pure searching is often a method to get partial points, but there are very few problems that you can get full marks for through pure search.

Classic problems

• 「kuangbin」Topic 1: Simple Search
• 「kuangbin」Topic 2: Advanced Search

---

buildLast update and/or translate time of this article，Check the history
editFound smelly bugs? Translation outdated? Wanna contribute with us? Edit this Page on Github
peopleContributor of this article OI-wiki
translateTranslator of this article Visit the original article!
copyrightThe article is available under CC BY-SA 4.0 & SATA ; additional terms may apply.

Comments