Skip to content

A java based GUI is developed to solve the problem of travelling from a starting block to any destination block , we need to find the shortest possible path if possible.

Notifications You must be signed in to change notification settings

Kdnjnv/Micromouse

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Micromouse

A java based GUI application in which we have to find the shortest path if possible , given a starting point, a destination point and lots of obstacles placed between them.

Platform : Eclipse

The project consists of two file @1 MicroMouse and @2 Grid . Initially run the MicroMouse file file and enter number of rows and columns less than 100 and press 'Go'.

A new Frame will appear with matrix size of m*n.

step 1. press 'select' button and select any block from the grid.

step 2. press 'destination' button and select any block from the grid.

step 3. press 'obstacles' button and select any number of block from the grid.

step 4. for selecting random number of obstacles once , press button 'Random'.

step 5. press button 'BuildPath'.

step 6. Finally press 'run' button it will show the path.

About

A java based GUI is developed to solve the problem of travelling from a starting block to any destination block , we need to find the shortest possible path if possible.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages