2010-09-29, 10:30 PM
With limited information like this, the best way to tackle it is to make an assumption, then test it.
EG.
Hypothesis: R is in the solution
Conclusion: bland (2) and barns (2) contradict one another
Hypothesis: R is not in the solution
Conclusion: Again, a contradiction is reached.
For an easy demonstration these clues are impossible:
Consider nodes (1) vs. bored (3) - once you eliminate the 's', due to 'stick', you're left with node (1) vs. bored (3).
In order to be true, B and R must both be in the solution. One of "ode" is in the solution, and 'n' is not in the solution.
Anyway,
S T I C K N - not in solution
B R - in solution
a, n, d, o, k, y, f, l, h - not in the solution
land - contains 1 letter
Contradiction!
Hypothetical error: nodes incorrect?
EG.
Hypothesis: R is in the solution
Conclusion: bland (2) and barns (2) contradict one another
Hypothesis: R is not in the solution
Conclusion: Again, a contradiction is reached.
For an easy demonstration these clues are impossible:
Consider nodes (1) vs. bored (3) - once you eliminate the 's', due to 'stick', you're left with node (1) vs. bored (3).
In order to be true, B and R must both be in the solution. One of "ode" is in the solution, and 'n' is not in the solution.
Anyway,
S T I C K N - not in solution
B R - in solution
Code:
h 0
fl 0
land 1
node 1
dane 2
doky 0
an 0
oed 1land - contains 1 letter
Contradiction!
Hypothetical error: nodes incorrect?

