This is a Melon puzzle. (15 – Smashed Sums – False)
or solve online (using our beta test of Penpa-Edit tools; use tab to shift between number entry and shading modes.)
Theme: 22nd WPC in 2013 (the shaded box is just meant to accentuate the theme and has no role in solving). This puzzle type appeared in Round 7 of the WPC from the Serbian constructors under the name “False Doppelblock”
Rules: Fill each row and column of the grid with the numbers 1-6 and two blackened cells. In this false variation, clue numbers outside the grid are either one higher or one lower than the sum of the digits between the two blackened cells in that row/column. True sums can equal zero if the black cells touch. Or see here, but remember this puzzle is a “false” variation with +1/-1 clues unlike that example.
Answer String: Enter the 1st row from left to right, followed by a comma, followed by the 8th row from left to right. Use an X (capital letter) for each blackened square.
Time Standards (highlight to view): Grandmaster = 10:00, Master = 17:30, Expert = 35:00
Solution: PDF
35 minutes.This was way too tougher than i had expected.Eventually it as a dual guess that helped me to complete.Can a walkthrough be provided if possible for this?
The tricky step for me was: Ng bar cbvag gur gbc naq obggbz bs gur guerr 8-ebjf obgu unir n frdhrapr ahzore-tnc-ahzore, nyvtarq. Vs fhpu n tnc pbagnvaf n ahzore, gur guerr-ahzore fgergpu zhfg or qverpgyl obhaqrq ol oynpx pryyf. Gur iregvpny pyhrf (11, 13) gura vzcyl gung ng zbfg bar bs gubfr 8-tncf pna or n ahzore.
This is not a full walkthrough, but here’s the trickiest part of my intended solution:
Gur xrl vf gung rvtug pyhrf unir yratgu orgjrra oynpx pryyf rvgure gjb be guerr.
Va rnpu bs ebjf guerr gb svir, ng yrnfg bar fdhner bhg bs pbyhzaf gjb gb svir zhfg or funqrq. Pbyhzaf guerr naq svir ner haninvynoyr fvapr gurl unir n uvtu pyhr ahzore. Fb bar bs ebjf guerr gb svir hfrf pbyhza gjb nf gur funqrq fdhner. Gur frpbaq funqrq fdhner va gung ebj unf gb or pbyhza fvk.
Va pbyhza fvk, gur guvegrra pyhr zrnaf gur bgure funqrq fdhner vf ng yrnfg guerr fcnprf njnl. Fb lbh pna trg ebj fvk pbyhza fvk vf hafunqrq, naq fbzr zber pnershy jbex ba ebj fvk nybat jvgu gur bofreingvbaf sebz nobir jvyy svaq gur funqrq fdhnerf va ebj fvk.
It should be noted that this was constructed as a WPC prep puzzle for a relatively high-valued puzzle in a round, and steps this intricate are standard fare for puzzles considered hard at a WPC. So I didn’t really hold back when making this puzzle.
Guys give me the name of the site to decode this pls.I have forgotten it…
rot13.com
If you use any form of UNIX, you can use this shell command client-side (just cut-n-paste):
$ tr ‘a-zA-Z’ ‘n-za-mN-ZA-M’
If you use a browser or RSS reader on OS X, then it is also possible to install a client-side Service to decode rot13. I use:
https://gist.github.com/nslater/4007384
with this line added before the return statement:
display alert output