This is pretty cool. I tried a while back to make it a bit easier to solve these types of problems where you have a start state, end state, and possible transit

This is pretty cool. I tried a while back to make it a bit easier to solve these types of problems where you have a start state, end state, and possible transitions and restrictions, and want to determine the transitions needed to get from start to end using a CNF solver. Here's the Rubik's cube example [1]. Currently uses MiniSat on the backend. It's pretty domain specific as languages go, but for certain problems it works well. [1] http://sabrlang.org/rubik/ http://sabrlang.org/rubik/ [2] http://sabrlang.org/code/rubik/source.txt http://sabrlang.org/code/rubik/source.txt [3] https://github.com/dbunker/SABR https://github.com/dbunker/SABR