| Name | Description | Size | Visibility | ||
|---|---|---|---|---|---|
|
This is a random maze generator that uses Kruskal’s algorithm.
You can change its size by modifying the “size” variable in the “main.py” script.
Generating the size 2 maze takes about 1 minute and 30 seconds.
After generation, the script will find the two furthest points and place the start and finish at these locations.
After that, you can solve it!
Once you have found the exit, the solution will be calculated and displayed.
You can also check out maze_generator_v2, which uses depth-first search algorithm.
Good luck!
|
7.14 KB | Public |
|
||
|
This is a random maze generator that uses depth-first search algorithm. You can change its size by modifying the “size” variable in the “main.py” script. Generating the size 2 maze takes about 15 seconds. After generation, the script will find the two furthest points and place the start and finish at these locations. After that, you can solve it! Once you have found the exit, the solution will be calculated and displayed.
You can also check out maze_generator_v1, which uses Kruskal’s algorithm.
Good luck!
|
6.05 KB | Public |
|
||
|
A simple particle system.
|
1.39 KB | Public |
|
||
|
This script is used to evaluate the probability of destroying a unit in the board game Memoir ‘44 with the binomial law. You can adjust:
the number of dice rolled,
the type of unit targeted,
the number of figures in the unit targeted,
whether retreating results in a loss,
whether a star results in a loss.
For more details, refer to the official rules of Memoir ‘44.
|
7.15 KB | Public |
|