## Windoku with Renban Groups II

(Eingestellt am 8. Mai 2011, 12:24 Uhr von zhergan)

Place the digits 1 to 9 in every row, column, 3x3 standard block. All digits inside 4 extra windows (represented by dashed lines) must also be different. Besides grey painted cells form renban groups. These groups must hold consecutive digits, in any order.

Lösungscode: First give the contents of Row 7 and Column 2, then give the digits which are included at least in 3 (out of 5) different renban groups descending in order.

Gelöst von Luigi, ManuH, rob, ibag, pokerke, Richard, Hansjo, rimodech, saskia-daniela, flaemmchen, zorant, Realshaggy, Alex, zuzanina, Rollo, Nothere, Statistica, joyal, RobertBe, Laje6, Mody, pin7guin, ... ildiko, Babsi, marcmees, annusia, verflixt, KlausRG, mango, PRW, Hasenvogel, Joe Average, Uhu, tuace, Carolin, skypper, sf2l, matter, Julianl, swotty, crissu, HugoSimon, rubbeng, Zzzyxas, Danielle
Komplette Liste

### Kommentare

am 31. Juli 2012, 21:56 Uhr von pin7guin
@Toastbrot: Er kann die versteckten Kommentare (noch) nicht lesen...

@rubbeng: Add the digits, which appear three times or more in the five renban groups, sorted from high to low, to your solution code.

am 19. Juli 2011, 18:52 Uhr von Oliver Strauß
Hi Pin7guin and Zhergan. Thank you for your help and the translated version. My first thought was to complex - but now I have it! Very nice puzzle.

am 17. Juli 2011, 15:50 Uhr von pin7guin
Vielleicht hilft Dir eine übersetzte Version?:
Reihe 7 und Spalte 2; dann die Ziffern, die in mindestens drei der fünf verschiedenen Renban-Gruppen vorkommen, in absteigender Reihenfolge.

Zuletzt geändert am 19. Juli 2011, 13:25 Uhr

am 17. Juli 2011, 14:01 Uhr von Oliver Strauß
HELP - HELP! I think my solved puzzle is correct. My problem seems to be the input of the solving code. Can anybody help me? Thank you very much.

@Oliver Strauß: Hi, pin7guin expressed the solution code in German (thanx Claudia for that). If you're still having some problems you may send your solution as a message which is only visible to author and solvers then I may check it and return to you. Or you may send it to me via PN using forum.

Zafer

am 8. Mai 2011, 22:46 Uhr von ibag
Very clever construction, thank you!

 Schwierigkeit: Bewertung: 84 % Gelöst: 65 mal Beobachtet: 3 mal ID: 00010O

Lösungscode: