You are browsing as a guest. Sign up (or log in) to start making projects!

Grid Traversal Visual

  • 3 Devlogs
  • 2 Total hours

Generates random (solvable) maps and allows the user to choose an algorithm to see how it traverses the grid/maze step by step

Open comments for this post

55m 50s logged

Today was a lot of debugging and more framework - almost all of the code I wrote in funcs.py was bugged in some way. My linearize and delinearize methods both were switching around what x and y mean, since I was thinking mathematically where x is horizontal and y is vertical, but since I was taking an x index before a y index, they should’ve been switched. After fixing those bugs and some more bugs in my adjacency map generator, I got those working, and laid out the framework for the first searching algorithm I’ll actually implement - Depth First Search. The attached screenshot shows the adjacency map with all bugs fixed.

0
0
4
Open comments for this post

36m 40s logged

Today I created the framework of my project - I started off with making two “maps” (the second one looks like the underscores and periods you see on the left), and coded something that randomly selects a map and generates a more visual image like the one seen. I also got started on a funcs.py file that’ll have a bunch of essential functions, such as taking a 2D array that represents a grid and making it an adjacency map (which’ll be useful for the first search algorithm I’m going to implement, depth first search).

0
0
3

Delete project?

Are you sure you want to permanently delete this project? This action cannot be undone.

All devlogs, followers, and associated data will be removed.

Followers

Loading…