Infinit Pacman with JavaScript. Using multiple path-finding algorithms: A*, Greedy Best First Search, and Hill Climbing Search
-
Updated
Aug 9, 2020 - JavaScript
Infinit Pacman with JavaScript. Using multiple path-finding algorithms: A*, Greedy Best First Search, and Hill Climbing Search
Using HillClimb algorithm to solve the N Queens problem
(pt-BR) Implementação em JavaScript de 5 algoritmos de buscas aplicados a um labirinto, onde se tem uma origem e busca-se um destino.
Deep search, Best-first Greedy search, Hill Climb
Add a description, image, and links to the hill-climbing-search topic page so that developers can more easily learn about it.
To associate your repository with the hill-climbing-search topic, visit your repo's landing page and select "manage topics."