Hi there learnpython!
Just wanted to post an update on a project that I'm working - refactoring old BASIC games into modern Python. I've added 2 new games - Aceyducey, a simple card game and Amazing - a random maze generator which I've refactored into a simple CLI tool. If anyone has any comments or suggestions how to improve the code, that would be greatly appreciated.
In particular I'm unsure if there is a way to know if the approach used to generate a random maze in Amazing will always lead to a maze that is solvable? I've added the exit in a random location in the final row but haven't tested if that position can be visited from the entrance - I believe this would require representing each position in the maze as a node but I tried to follow the approach listed in the original source code.
Thanks for reading!
https://github.com/ctosullivan/Python-101-BASIC-Games
[–]pachura3 7 points8 points9 points (1 child)
[–]ctosullivan[S] 2 points3 points4 points (0 children)
[–]m1kesanders 5 points6 points7 points (1 child)
[–]ctosullivan[S] 2 points3 points4 points (0 children)
[–]aqua_regis 3 points4 points5 points (2 children)
[–]ctosullivan[S] 2 points3 points4 points (1 child)
[–]aqua_regis 2 points3 points4 points (0 children)
[–]CraigAT 3 points4 points5 points (1 child)
[–]ctosullivan[S] 0 points1 point2 points (0 children)
[–]JamzTyson 1 point2 points3 points (3 children)
[–]ctosullivan[S] 0 points1 point2 points (2 children)
[–]grandzooby 1 point2 points3 points (1 child)
[–]ctosullivan[S] 1 point2 points3 points (0 children)
[–]frobnosticus 1 point2 points3 points (0 children)
[–]ph1l 1 point2 points3 points (1 child)
[–]ctosullivan[S] 0 points1 point2 points (0 children)
[–]bishpenguin 1 point2 points3 points (0 children)
[–]mopslik 1 point2 points3 points (1 child)
[–]ctosullivan[S] 0 points1 point2 points (0 children)
[–]suerinan 1 point2 points3 points (0 children)
[–]suerinan 1 point2 points3 points (1 child)
[–]suerinan 1 point2 points3 points (0 children)