anytime-algorithm

Probabilistic Focal Search (PFS) introduces a probabilistic mechanism to balance guided search and lower-bound advancement, reducing node expansions in bounded-suboptimal search problems, with significant gains in benchmarks like N-Puzzle and TSP.