Solving 'Hundepuzzle' with High School Maths Only

Click For Summary

Discussion Overview

The discussion revolves around the 'Hundepuzzle' game, exploring whether it can be solved using only high school mathematics and if there are equations or procedures that can lead to solutions. Participants express curiosity about the mathematical foundations required for solving the puzzle without resorting to higher mathematics or informatics.

Discussion Character

  • Exploratory
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants inquire if the puzzle can be solved with high school mathematics and seek equations that do not require advanced mathematical concepts.
  • Others clarify the nature of the puzzle, describing the arrangement of cards and the requirement for matching dog images.
  • A participant suggests that the solution may not be an equation but rather a procedure for solving the puzzle efficiently.
  • There is a debate about the number of solutions, with some asserting that there are multiple solutions due to the ability to rotate tiles, while others challenge this view.
  • Some participants propose using backtracking as a method for solving the puzzle, while others argue about the efficiency and classification of this approach as brute force.
  • Discussions arise regarding the definitions of brute force and rigorous proof, with differing opinions on their validity in the context of solving the puzzle.

Areas of Agreement / Disagreement

Participants do not reach a consensus on whether an equation can be formulated for the puzzle, the number of solutions available, or the classification of backtracking as a brute force method versus a more efficient algorithm.

Contextual Notes

Participants express uncertainty about the assumptions underlying the puzzle's configurations and the implications of edge matching. The discussion also highlights varying interpretations of mathematical proof and solution methodologies.

  • #31
pioneerboy said:
y, I can't contribute to the solution as such else than an algorithm might be best built up upon the declaration of the 4 dogs as letters A, B, C, and D and the differentiation of heads and tails into small and large letters (a, b, c, d, A, B, C, D), whereas on a card heads and tails are always opposite of each other and two neighbouring cards would result in a whole dog of the form of e.g. a¦A.

I used numbers {1,2,3,4} for heads and {-1,-2,-3,-4} for tails instead. That makes matching cells much easier. I used if(one_cell == -the_other_cell) but I could have obfuscated it with something like if(!(one_cell+the_other_cell)) for a more C-ish look.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 31 ·
2
Replies
31
Views
4K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 21 ·
Replies
21
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 49 ·
2
Replies
49
Views
6K
  • · Replies 37 ·
2
Replies
37
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 31 ·
2
Replies
31
Views
6K
  • · Replies 8 ·
Replies
8
Views
4K