Project Euler Forum

Problem 766 (View Problem)

So here are some assumptions:
- The initial position is a reachable position
- You can't rotate the blocks
- Blocks can't intersect
- There must be a sequence of valid "slides" from the initial position to the reachable position (So there are some unreachable patterns that are still valid "tilings")

With these rules, I get a 2-digit answer from counting (the confirmation code has more digits ) and my answer appears to be wrong!

Can I PM someone (who already solved the problem obviously) about this?

EDIT: I found what's wrong! Turns out, what appears to be a purple 2x3 block is (are?) actually six 1x1 blocks! (I was fooled by the 3 kids in a trenchcoat trick )

Now that there are too many positions to just count, I will ditch the problem for now. I don't need the PMs anymore.

So here are some assumptions:
- The initial position is a reachable position
- You can't rotate the blocks
- Blocks can't intersect
- There must be a sequence of valid "slides" from the initial position to the reachable position (So there are some unreachable patterns that are still valid "tilings")

I've followed those assumptions as well.

I'm struggling to find any errors in my code, and it passes the 208 configuration test case. So for my sanity can someone confirm that those assumptions are correct?

I can confirm those assumptions are correct. Would also add that blocks cannot slide off the grid.