Get the path from one position to another (returns direction indices)

Enhanced heuristic considering box mobility

Apply a move to get new state

Compute simple deadlocks (corners only for now - edge detection is complex)

Find all possible moves for current position (Festival approach)

Hungarian algorithm for minimum cost bipartite matching

Minimum matching heuristic (greedy approximation)

Reconstruct solution from moves with stored player paths

Calculate distances from a position to all reachable cells

Check if player can reach a position

Old expand function - keeping for reference

Check for freeze deadlock (2x2 box configuration)

* @param {string} level * @param {number} time_limit_ms * @param {Function | null} [progress_callback] * @returns {any}

* @param {string} level * @param {number} time_limit_ms * @returns {any}