https://github.com/demirelakif/binarymaze-dijkstrashortestpath

In the binary maze Smurfs game, there are two enemies: CatAzman and Gargamel. They aim to catch you using Dijkstra's shortest path algorithm.
https://github.com/demirelakif/binarymaze-dijkstrashortestpath

Last synced: about 8 hours ago
JSON representation

In the binary maze Smurfs game, there are two enemies: CatAzman and Gargamel. They aim to catch you using Dijkstra's shortest path algorithm.

• Host: GitHub
• URL: https://github.com/demirelakif/binarymaze-dijkstrashortestpath
• Owner: demirelakif
• Created: 2021-03-28T01:31:04.000Z (almost 4 years ago)
• Default Branch: main
• Last Pushed: 2021-03-28T01:45:03.000Z (almost 4 years ago)
• Last Synced: 2024-11-12T16:36:45.789Z (2 months ago)
• Language: Java
• Homepage:
• Size: 825 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# BinaryMaze-DijkstraShortestPath

Smurfs game in the binary maze, have two enemy, Azrael and Gargamel. Gargamel, moving 1 unit faster than Azrael. they want to catch you with using Dijkstra's shortest algorithm.

we have two heroes, Lazy Smurf and Brainy Smurf.  Brainy Smurf, moving 1 unit faster than Lazy. We have score starting 20 And our goal is reaching Smurfette with have score more than 0.

Run menu file.

![Ekran Alıntısı](https://user-images.githubusercontent.com/59124957/112739625-89792000-8f7e-11eb-96fa-bccab2d0e38c.PNG)