2
$\begingroup$

I'm working on a CayleyPy project where we study the diameters of graphs that come from different combinatorial puzzles. At the moment I’m focusing on the Picture-Cube, a 3×3×3 puzzle where each move permutes parts of the picture on its faces.

To test several hypotheses, I need a simple and convenient solver for this puzzle, ideally a Python program that takes a scrambled state and returns a sequence of moves. If anyone has such a solver or knows about an existing implementation, I would appreciate it.

Improve this question
$\endgroup$
5
  • 1
    $\begingroup$ Welcome to Puzzling Stack Exchange. This looks like a "big list"/recommendation question, which is probably off-topic for our site. The problem with such questions is that there can theoretically be an infinite list of answers (i.e. a "big list"), and no answer would be a definitive final one. If someone released a new tool a few years later, then people could add it as another answer, etc. etc. $\endgroup$ Commented Nov 14 at 21:27
  • $\begingroup$ In addition, question posts are not a place to recruit people to your project. You could try doing that in your profile or in chat (20 reputation to access our site chat, or 1 reputation to access the network lobby), though I don't think you'd be successful. $\endgroup$ Commented Nov 14 at 21:29
  • $\begingroup$ Our chat is exactly the correct place to ask this, but since we're a SE site, we have a rep limit for doing that. So, we'll upvote you twice, you go to the chat, and then you kill this question, if that's fine with you :-) $\endgroup$ Commented Nov 14 at 22:54
  • $\begingroup$ @Lilly, if you want access to the chat, I've just remembered that it's possible to give you access to a chatroom manually, even if your reputation is too low. If you would prefer to discuss in chat, just ping me here, and I'll grant you access to our site chat. $\endgroup$ Commented Nov 15 at 2:05
  • $\begingroup$ Related: Does Python Megaminx Solver exist? $\endgroup$ Commented Nov 15 at 6:33

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.