peek at solution solve puzzle
quality: difficulty: solvability: moderate lookahead
Puzzle Description:
...dessert
#1: Web Paint-By-Number Robot (webpbn) on Dec 1, 2009
Found to be logically solvable by Gator.#2: Gator (Gator) on Dec 1, 2009 [HINT]
I used a contradiction to find that R3C1 had to be a dot.#3: Jota (jota) on Dec 1, 2009
Thanks for your entry! Would you please re-name it " WCP #48 My ..."#4: Brian Bellis (mootpoint) on Dec 1, 2009
Sure, thanks. Is it OK if I made a second entry?#5: Jota (jota) on Dec 2, 2009
Yes, only one could be considered a winner but you can entry as many as you want.#6: Adam Nielson (monkeyboy) on Dec 2, 2009
Fun puzzle to solve.#7: Jane Doe (telly) on Dec 2, 2009
nice. fun to solve.#8: Fran (rmm) on Dec 16, 2009
Very neat fun :)#9: Joe (infrapinklizzard) on May 27, 2013 [HINT]
Regular two-way logic works to prove r3c1 is white.
Use the two-way logic on the 1 in r5 (it can only be put in c1 or 2).
If it goes in c1, then r3 must be white (due to the 2 in c1).
If it goes in c2, then r3c2 must be white (due to the 2 in c2), which then makes r3c1 white (due to the 7 in r3).
Either way r3c1 must be white.
Then line logic to finish.
You must register and log in to be able to participate in this discussion.