Logic Masters Deutschland e.V.

Neighbours (1)

(Published on 7. February 2014, 12:00 by Richard)

Hans Eendebak invented the puzzle type Neighbours in 2012. It was one of the types in the Dutch round of Eighty puzzles around the World during WPC in Beijing in 2013.

Place digits 1-3 in the grid so that in each row and column each digit appears three times. (Twice in the example.) Numbers in grey cells do not share an edge with a cell containing the same number. Numbers in white cells share an edge with at least one cell containing the same number.



Solution code: Row 7, followed by column 2.

Last changed on on 7. February 2014, 19:41

Solved by zuzanina, r45, CHalb, Statistica, lutzreimer, zorant, ibag, sloffie, adam001, Zzzyxas, flaemmchen, Alex, ffricke, Joo M.Y, Mody, pin7guin, Eisbär, Rollo, ch1983, saskia-daniela, sandmoppe, RALehrer, ... pwahs, usp, moss, kyrka, Saskia, jirk, lubosh, skywalker, Mathi, Circleconstant314, Kekes, Dotty, Krokant, Julianl, amitsowani, cdwg2000, Puzzle_Maestro, athin, Lagavulin, geronimo92, misko, Cow
Full list


on 24. July 2020, 10:31 by Lagavulin
Mal was anderes - hat richtig Spaß gemacht - Danke!

on 16. March 2014, 14:50 by SilBer
Sehr sehr schöne neue Rätselart!

on 7. February 2014, 19:42 by Richard
The (1) in the title implies more puzzle(s) of this type. :-)

on 7. February 2014, 19:41 by Richard
Inserted an h in the title. Thanks CHalb and Rollo

on 7. February 2014, 17:10 by Rollo
Add an h and bring some more!

on 7. February 2014, 16:56 by pin7guin
Schöne neue Variante!

on 7. February 2014, 15:12 by flaemmchen
Hat mir sehr gut gefallen ... gibt es jetzt einen "Neigbour-Monat"?? Das wäre schön :-)

on 7. February 2014, 14:00 by ibag
Wirklich originelle Idee!

Last changed on 7. February 2014, 13:24

on 7. February 2014, 13:19 by CHalb
Very nice. Thanks for introducing this type to me. I'm sure there are steps in it I haven't recognized yet. So another one would be fine.

Rating:86 %
Solved:115 times
Observed:1 times

new puzzletype standard puzzle

Enter solution

Solution code: