搜索部分简介
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¶
build本页面最近更新：，更新历史
edit发现错误？想一起完善？ 在 GitHub 上编辑此页！
people本页面贡献者：OI-wiki
copyright本页面的全部内容在 CC BY-SA 4.0 和 SATA 协议之条款下提供，附加条款亦可能应用