I got most of the code working last night. At some point I had an issue that was making me angry. I scrapped most everything and began making mark 2. This will be faster and cleaner. As long as I’m starting over, and I have no idea why I decided that was a good idea, I decided I’d be going object oriented as well. That’s always been a sticking point with me. The idea of objects having functions built into the object itself is just kinda weird. Than again, as a strict amateur, I began with using goto statements in basic, so I guess anything is weird.
Whatever, so far it’s a lot cleaner now. Half that cleanliness is due to my already having written half the functions already, and I’m just remaking them using multi-dimensional arrays and stuff. It mostly works, but I need to add a manual increment, as right now, it freaks the hell out. I’m assuming it’s just burning through seeds until it appears dead. I don’t know what seed it was on though, so that doesn’t work too well. That’s why I need to implement an any key. Or I could just make a test and add a delay(). At least that’s what I did. I’m seeing if it works right now. I’m over 7,000 permutations as I type. I’m guessing before we overload the definition of an Int I should check if we made it.
This solver is based on a random seed driving the pieces. 11k. It’s going fast, but I don’t really know if it’s going right. I should try building a box that’s 1x1x1, which would tell me if it could find the good copies. At some point. I’m now at 15k, Is this going to solve my challenge? Either way it’s good practice, but not necessarily great practice. 24k. Hmmm. The funny thing is I still don’t have a way to see the final solution, this is just to find a solution. 28k.
