Bricklayer
(Eingestellt am 3. August 2025, 03:43 Uhr von juggler)
Within each N by N grid:
- Place the digits 1 to N once each in every row and column.
- No two bricks have the same digits.
- Bricks are grouped by sum, i.e. bricks with the same sum always form an orthogonally connected group. Bricks cannot connect across broken edges.
Lösungscode: Column 4 (11 digits)
Kommentare
am 31. August 2025, 03:32 Uhr von Frank Puzzles
Very Nice puzzle! I would recommend a couple of slight tweaks to the rules to clarify them:
"No two brick in the same NxN grid have the exact same digits"
and
"Bricks that sum to the same sum must form a single orthogonally connected group with all other blocks with the same sum in that NxN grid"
I also do a solve of this puzzle on my channel that will come out in about a week. Let me know if you want me to post a link to the solve when it comes out.
Fun logic behind all the brick puzzles. Keep them coming!
---
juggler: Thanks! Re rules, "Within each N by N grid" is the line that specifies that--but yeah maybe it can be clearer.
Frank: Ah, I see. Yeah, For some reason I completely missed that the Within each N by N grid applies to all the rules. Nevermind then.
am 11. August 2025, 02:51 Uhr von scottgarner
Incredibly unique puzzle!
am 3. August 2025, 18:34 Uhr von ViKingPrime
A duck walks into a bar and orders a drink.
The bartender is shocked - he's never seen a talking duck before - but what are you going to do? He serves him a drink.
The bartender eventually works up the courage to make some small talk.
'So, uh, what do you do for a living?'
The duck looks at him like he's got two-heads. He points to his outfit: hard hat, safety vest, steel toe boots.
'I work at the construction site across the street.'
'Right, right, of course. You know, you might consider joining the circus? I don't mean any offense but you'd probably make a tonne of money.'
Again, the duck looks at him.
'What would the circus need with a bricklayer?'
---
juggler: nice, hadn't heard that one. at least he wasn't trying to buy grapes!
am 3. August 2025, 04:26 Uhr von MSDOS
A few critical steps took me a bit to spot, but I really enjoyed the solve! Thanks!
am 3. August 2025, 04:20 Uhr von arctan
took me a few moments to fully wrap my head around all the rules and their implications, but well worth it, and i love the way the broken bricks interact with the solve path
