Jane Street Puzzle: Numbers 4
Puzzles are fun! I hope I can continue to carve out time to solve them in the future…
You can see my code here: Github Link
Solution
The general solution I took was in 2 parts.
Part 1: Find all possible solutions for each row
The bulk of the time is spent finding all possible solutions for each row taking into consideration possible shading, groups of cells, and validity of the clue. For example, if we look at row 4 in the 5 x 5 example we know we are looking for a cube. The number 12,167 is a cube however it would break the rules of groupings (columns 1 & 2 are in the same group and thus need to have the same number). Therefore we can exclude 12,167 as a valid solution for row 4.
✅ Shading is valid
✅ Clue is valid (12,167 is a cube)
❌ Grouping is not valid (must be the same number)
✅ Shading is valid
✅ Clue is valid (27 and 64 are cubes)
✅ Grouping is valid
For certain rows, this can be very timeconsuming because the validation function is expensive and because there are so many distinct groups that we can form many different numbers. The rows that take the longest in the 11 x 11 puzzle are row 5 and row 3 which take 90% of the time.
I did consider looking at rows relative to their ancestor above and backtracking but because it worked I didn’t have a ton of time to optimize I left it as is.
Part 2: Find a valid matrix
Once we have all possible solutions to each row we “stitch” them together row by row to get a valid matrix that satisfies all the constraints. We start with one valid row and loop through the next row until we find a valid one and proceed down the tree of possibilities backtracking as we go. This is fast because we know the rows in isolation are valid but just check if the shaded cells are valid relative to each other and that groupings are valid relative to each row.
Row 1: X 3 4 3 X

/ \
Row 1: X 3 4 3 X X 3 4 3 X
Row 2: 2 1 X 5 5 1 3 X 5 5
(Invalid) (Valid)
Notes & Improvements
 Codifying the groups for the 11 x 11 matrix was exhausting. I tried to get ChatGPT to help me with it but sadly it failed over and over to be able to turn the matrix into grouped coordinates… ugh.
 My first attempt was to try and create all permutations of shaded regions and then fill in each row but that proved to be impossible so my final solution here was a realization that the hints could greatly narrow down the search space for each row based on groupings.
 My gut tells me there are faster ways to do this by not precomputing each row which I thought about implementing but I didn’t want to put too much more time into this puzzle so I left it as is.