1aed770b9b
Change A* heuristic to be a proper estimate
...
This makes it:
- Actually find the path with the fewest number of moves, and
- Not be so prone to getting stuck exploring space that seems "close to
a solution" but is actually a dead end.
2025-09-13 16:51:59 -07:00
50f7dd20f6
Merge pull request 'add seeding for rng' ( #4 ) from computerdruid/hanoigame:push-rwkpyulnxrwu into main
...
Reviewed-on: jana/hanoigame#4
2025-09-08 20:06:27 +02:00
3e15a32a48
add seeding for rng
2025-09-03 11:52:30 -07:00
cf5b93cb0d
Merge pull request 'fix error handler' ( #3 ) from computerdruid/hanoigame:push-omrvkqpsolyv into main
...
Reviewed-on: jana/hanoigame#3
2025-09-03 19:41:02 +02:00
1a41781aea
Merge pull request 'clippy lints' ( #2 ) from computerdruid/hanoigame:push-lrpsrlkrtkor into main
...
Reviewed-on: jana/hanoigame#2
2025-09-03 19:40:42 +02:00
48e963e723
Merge pull request 'Better color choices' ( #1 ) from computerdruid/hanoigame:push-oxqrmowvprlq into main
...
Reviewed-on: jana/hanoigame#1
2025-09-03 19:40:23 +02:00
db22d1912e
Better color choices
2025-09-03 10:38:13 -07:00
795de79884
clippy lints
2025-09-03 10:37:57 -07:00
ea3c02262f
fix error handler
2025-09-02 13:33:33 -07:00
1e3fca6f51
fix bugs
2025-09-02 21:41:28 +02:00
4f7790d1d5
solver
2025-09-01 18:50:40 +02:00
c07c5dd117
game
2025-09-01 17:19:12 +02:00
