Logic Masters Deutschland e.V.

Foxtrot

(Published on 1. August 2024, 18:40 by zetamath)

[This puzzle was created with the friends in my stream. Thanks for your help everyone! You can find a VOD of its creation here ]

Fillomino: Divide the grid into ominos so that no two ominos of the same size touch orthogonally. Fill each omino with its size.

Doubleback: Draw a simple loop which passes orthogonally through the center of every cell in the grid. The loop visits every omino exactly twice.

Arrows: Since each omino is visited twice, each omino contains two paths. An arrow from a cell containing the number N to another cell indicates that at least one of the paths in the omino pointed to has length N.

The loop does not cross the given X, but the given X may be an edge.

Have fun, leave a comment if you enjoy the puzzle!

This puzzle is available on Sudokupad and on Penpa.

PS: I stream solving sudoku like puzzles two days a week. You can check out the channel, as well as some videos I have made about setting puzzles, at my YouTube channel here.

Solution code: The lengths (in cells) of the vertical loop segments in column 9, ignoring horizontal loop segments. No spaces.

Last changed on on 28. August 2024, 21:18

Solved by Mr_tn, smckinley, wooferzfg, dogfarts, MaizeGator, tuturitu, jkuo7, Bootenks, Uskok, karlmortenlunna, misko, Nell Gwyn, Ambrose, softie, widjo, bernhard, Jesper, teff, GoogleEnPassant, Niverio, MountBecton, sth
Full list

Comments

on 28. August 2024, 21:18 by zetamath
I fixed the link to the setting video!

on 12. August 2024, 21:50 by Jesper
Really enjoyable hybrid, thanks!

on 4. August 2024, 02:17 by Uskok
Thank you for the puzzle, I enjoyed it. It seemed daunting at first but there was always a logical step forward. Can't wait for Simon to slay it in quarter of my time while calling it the most beautiful puzzle he has ever seen.

on 2. August 2024, 02:59 by wooferzfg
Fun puzzle, thank you. The combination worked very naturally

on 2. August 2024, 02:54 by zetamath
Added a couple clarifying words to the solution code.

on 2. August 2024, 00:46 by smckinley
Excellent, thank you!

Difficulty:4
Rating:97 %
Solved:22 times
Observed:2 times
ID:000J68

Enter solution

Solution code:

Login