Perform Greedy Best-First Search from start_state using the given heuristic. Prioritizes nodes purely by heuristic value (h(n)). Returns the solution path if found, otherwise None.

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.