TODO: Panchinko tree search algorithm. Start at root and go down, taking random turns until you hit a leaf or find the thing. If you don't find the thing, start over at the root. Requires 0 memory, eventually will find the thing. If it doesn't exist, give up after some arbitrary long time.
I need to make a website called dweebcode, for solving stupid problems
♡ 0 ↻ 0