Closed McSinyx closed 6 years ago
The current binary tree algo is flawed and retarded. The generation should be:
Still it need to be fast (since we'll need to regenerate every few frames) and infinite (perfect loops don't count).
Until this actually get solved, I'll try to draw the maze rotated 45° to the right to make the flaw seem to be intended.
This is really solved now.
The current binary tree algo is flawed and retarded. The generation should be:
Still it need to be fast (since we'll need to regenerate every few frames) and infinite (perfect loops don't count).