3 ms·
Proof of Work based off of Rubik's Cubes
- taeric 6y agoI'm pretty sure this isn't as hard as it sounds. There are that many states, but there are not a factorial number of transitions. I often link to my blog where I explore permutations to do this, here https://taeric.github.io/cube-permutations-1.html https://taeric.github.io/cube-permutations-1.html. pretty sure this with a sims table would be all you need for a set of transitions. Now... The minimal set is a different beast. But, not sure how to prove you have the minimal one. :(
- raedyPlayer0ne 6y agoOh wow thank you for this reply yeah haha as I said I was a little iffy on how to devise an algorithm to transition from one state to another fast enough to where this would be viable. I will definitely check this out.
- taeric 6y agoI should have explicitly said I liked the article! I forget that up votes are not public. If you find something, please share! Good luck!