https://github.com/11belowstudio/ce213-ninesquaresolver

This is the thing I made for my CE213 Artificial Intelligence assignment. Basically, it's a nine square solver that uses bidirectional breadth first search. and it go nyoom.
https://github.com/11belowstudio/ce213-ninesquaresolver

Last synced: about 6 hours ago
JSON representation

This is the thing I made for my CE213 Artificial Intelligence assignment. Basically, it's a nine square solver that uses bidirectional breadth first search. and it go nyoom.

• Host: GitHub
• URL: https://github.com/11belowstudio/ce213-ninesquaresolver
• Owner: 11BelowStudio
• License: mit
• Created: 2020-05-22T19:33:13.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2020-05-22T19:47:09.000Z (over 4 years ago)
• Last Synced: 2024-11-11T06:39:41.424Z (about 2 months ago)
• Language: Java
• Size: 10.7 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# ce213-NineSquareSolver

This is the thing I made for my CE213 Artificial Intelligence assignment. Basically, it's a nine square solver that uses bidirectional breadth first search. and it go nyoom.

# what it does

so basically it just solves a 9-square puzzle with an initial state of this:

```

8 7 6

5 4 3

2 1  

```

to a goal state of this: 

```

1 2 3

4 5 6

7 8  

```

via bidirectional breadth first search (and outputs the moves taken to get to this state to an output.txt file).

and does it pretty quickly too, which is nice.

yeah that's basically it.

# credits

* Built off some sample code provided by Professor John Gan

* everything else by me