Combinatorial Search Optimization Planning

Use this when the user needs to solve complex logic puzzles, evaluate solvability, find the best route through millions of points, or optimize resource allocation in NP-hard problems with irregular structures. Trigger it for requests like 'solve this massive 10-million node route', 'find a Steiner tree for these points', 'solve this asymmetric delivery problem where road A-to-B is different than B-to-A', or 'solve a logic challenge designed to break simple guessing algorithms'.

dingxingdi Updated 1 repo stars

File contents

dingxingdi/paper_fast_search_backup commit 144ebeb535

Frequently asked questions

npx get-skill add dingxingdi/combinatorial-search-optimization-planning