Puzzle! 8 pieces, over 2500 ways to solve. How is it possible
There is a puzzle with 8 pieces and one single board to put them.
The board is labeled with months and dates.
Your goal is to place this 8 pieces in a way that leaves only 2 squares open.
That 2 square declare the date you have solved.
You can place them on the board and solve every possible date, meaning 366 solves in total.
Also for one date there are multiple ways to solve it. I have even made 44 solve for 25 Jun!
How is that possible? Would it work with different pieces or a different board? Is there some way to prove that is solvable or that it is not? Is there any topology approach we could use?
I have spend hours in this as you can see and solved the all 366 dates, so I can say for sure that it is working but HOW!? http://prntscr.com/21lumhp
You can currently find the app only on play store, it is called 365 Days Puzzle
https://play.google.com/store/apps/details?id=com.CoffeeStudios.puzzle365
Motzo
- closed
- 766 views
- $2.95
Related Questions
-
Math Proofs: "An alternative notation is sometimes used for the union or intersection of an indexed family of sets."
- Generalization of the Banach fixed point theorem
- Characterizing the Infinitely Visited Intersections in a Ride-Forever Path on a Directed Graph
- Proof through inclusion (A∆B) ∪ A = A ∪ B
- Let $(X, ||\cdot||)$ be a normed space. Let $\{x_n\}$ and $\{y_n\}$ be two Cauchy sequences in X. Show that the seqience Show that the sequence $λ_n = ||x_n − y_n|| $ converges.
- Induction proof for an algorithm. Introductory level discrete math course. See attachment for details
- Topic: Large deviations, in particular: Sanov's theorem
- Undergrad algebraic topology proof
Your offer is way too low dude!
I don't even understand the question. Is it possible to prove that all positions are solvable? Well, yes, you just did by solving all positions.