Computer Plays: Dots 

Your algorithm is known as the DFS, or depth-first search. It's a viable way of solving such Eulerian path problems and is well-studied. I can imagine the BFS's dual algorithm, breadth-first search, would give just as elegant solutions. This video is a nice first-hand account of playing around with graph theory.

I was just watching reccomended things and you came along. I just assumed you were a relatively large creator I hadn't discovered yet... I was shocked to see the numbers below your videos! Everything about these videos screams something that tonnes of people would watch. I did see a few videos hit big in the past. And the recent comments here give me the impression you're gaining a bit of the algorythms(tm) favour. I sincerely hope more people get to see your uploads man! Love it.

This is a good video (and definitely deserves more views and engagement, as mentioned above), but based on the title, I clicked it hoping it was going to be an analysis of the classic pencil and paper game Dots (also called Sprouts) where two players take turns drawing a line between two dots, adding a new dot somewhere along the line they have drawn. The full rules of the game are extremely simple, but the game is complex enough that several mathematical papers have been written on it; however, I have seen vanishingly few videos on RU-vid about it, and none which take a simulation approach to their analysis. It seemed like a perfect fit for this channel, and I was pretty excited to see something nostalgic from my childhood covered here. Perhaps an idea for a future video? But either way, looking forward to seeing what comes next for you.

There's much more efficient approach to find the path. If there are two odd degree vertices, start in one of them and build a path until you run into dead end at that other odd degree vertex. That will be your one and only open path. If you need to, you can close it using extra path between the start and end. If all vertices are even degree, skip that step. Then find any edge that is not used yet and extend it until you run into where you started and could not continue. Keep doing this until you exhausted all edges. Then go through your list of paths and merge them one by one by always crossing two paths going through the same vertex. When done right, this has O(N) complexity where N is proportional to number of edges.

honestly surprised somthing like this was on steam, looks like one of the puzzle games that'd get popular on newgrounds during its darkage.

When I think of Dots, its the 2 player game that starts with a latice of dots, and each player takes a turn by connecting 2 adjacent dots.If that move completes a 1x1 square, they get to go again.

Very cool video! I loved the background you gave on the history of this type of puzzle.

Your channel is a gem, I hope you get famous in the near future!

6:06 Ein Land, ein Reich, ein Kommentarbereich Ore roses are red bombs go boom dieses kommentarsektion ist nun deutsches eigentum

69th like. Also amazing video