Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/mlazaric/hanoi-matlab
A MATLAB function that generates a graph object of the possible moves in a Hanoi game with numOfPegs pegs and numOfDisks disks.
https://github.com/mlazaric/hanoi-matlab
graph hanoi-towers matlab
Last synced: 10 days ago
JSON representation
A MATLAB function that generates a graph object of the possible moves in a Hanoi game with numOfPegs pegs and numOfDisks disks.
- Host: GitHub
- URL: https://github.com/mlazaric/hanoi-matlab
- Owner: mlazaric
- License: mit
- Created: 2018-04-19T15:09:30.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2018-12-06T10:03:45.000Z (about 6 years ago)
- Last Synced: 2024-11-06T21:46:45.520Z (about 2 months ago)
- Topics: graph, hanoi-towers, matlab
- Language: Matlab
- Homepage:
- Size: 38.1 KB
- Stars: 3
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Hanoi Matlab
A simple function that generates a graph object of the possible moves in a game of Hanoi with `numOfPegs` pegs and `numOfDisks` disks.
## Explanation of the graph
Each node represents a possible state of the Hanoi game and each node is represented by a string with `numOfDisks` characters where the `k`-th element represents the position of the `k`-th biggest disk, so ABC means the biggest disk is on the first peg, the second biggest is on the second one and the smallest one is on the third peg.
Each edge represents a valid move in the game.
## Examples
### 2D Graph
```
G = hanoi(3, 3);
plot(G);
```
### 3D Graph
```
G = hanoi(2, 4);
p = plot(G);
layout(p, 'force3');
view(3);
```
### Shortest path
```
G = hanoi(3, 3);
p = plot(G);
path = shortestpath(G, 'AAA', 'CCC');
highlight(p, path, 'NodeColor', 'r', 'EdgeColor', 'r');
```
