• Python
• Coming Soon

This project is in the first stages of development.

I have a cube puzzle like a [link: soma cube] that I found really difficult to solve! It made sense to try and do it in an algorithmic way - there are only a certain number of ways that pieces can be placed, so trying each to brute force the solution should work! The aim will be to allow users to enter the pieces that they have (these cube puzzles can have different shaped pieces), and for the program to try to find the solution (if there is a way to fit them within a larger cube).

I will be exploring the most efficient way to do this, as brute forcing without eliminating impossible positions will be very costly! Some considerations could be: starting from the biggest to smallest piece, checking whether pieces are identical in different orientations, etc.

You can track the project's progress at: Here!