https://github.com/doguedogue/rutamascortabb

Shortest path in a Maze using Branch and Bound Search
https://github.com/doguedogue/rutamascortabb

Last synced: 11 days ago
JSON representation

Shortest path in a Maze using Branch and Bound Search

• Host: GitHub
• URL: https://github.com/doguedogue/rutamascortabb
• Owner: doguedogue
• Created: 2020-02-25T02:15:27.000Z (almost 5 years ago)
• Default Branch: master
• Last Pushed: 2022-07-08T13:51:24.000Z (over 2 years ago)
• Last Synced: 2024-10-26T22:11:19.766Z (about 2 months ago)
• Language: Java
• Size: 16.6 KB
• Stars: 0
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Shortest path in a Maze using Branch and Bound Search

Find shortest path from source (0, 0) to destination (7, 5)

Initial

1 1 1 1 1 0 0 1 1 1 

0 1 1 1 1 1 0 1 0 1 

0 0 1 0 1 1 1 0 0 1 

1 0 1 1 1 0 1 1 0 1 

0 0 0 1 0 0 0 1 0 1 

1 0 1 1 1 0 0 1 1 0 

0 0 0 0 1 0 0 1 0 1 

0 1 1 1 1 1 1 1 0 0 

1 1 1 1 1 0 0 1 1 1 

0 0 1 0 0 1 1 0 0 1 

Final

3 3 1 1 1 0 0 1 1 1 

0 3 3 1 1 1 0 1 0 1 

0 0 3 0 1 1 1 0 0 1 

1 0 3 3 1 0 1 1 0 1 

0 0 0 3 0 0 0 1 0 1 

1 0 1 3 3 0 0 1 1 0 

0 0 0 0 3 0 0 1 0 1 

0 1 1 1 3 3 1 1 0 0 

1 1 1 1 1 0 0 1 1 1 

0 0 1 0 0 1 1 0 0 1 

Número de pasos: 12