I made a Fillomino in the latest issue of Puzzler's Bulletin! Check out the bulletin to see the puzzle.
Follow
Chaotic Puzzles
@chaotic_puzzles
Joined February 2018
Chaotic Puzzles’s Tweets
Cerebral Puzzle Showcase has officially begun!
store.steampowered.com/sale/CerebralP
Check out hundreds of amazing puzzle games, including demos of upcoming titles, livestreams from some of our favourite streamers, and a fair few eye-popping discounts, available until May 23.
44
33
P.I.HUNT 8 is out now! I'm excited for people to finally see it as I think it's something really cool this year!
jacoblance.wordpress.com/2022/03/14/p-i
P.S. The gaps in the solution to the previous tweet spell PI 8
4
22
Silph Puzzle Hunt has ended. I wrote for it; one of which is the following.
[Sus Fillomino]
If two regions are *not adjacent* (instead of adjacent), they must have different sizes. Otherwise Fillomino rules apply.
3
1
5
Show this thread
One of the best puzzle games this year.
Also, it's free, so go check it out!
Quote Tweet
N Step Steve: Part 1 is out now! epicpikaguy.itch.io/n-step-steve-p
1
4
Topics to follow
Sign up to get Tweets about the Topics you follow in your Home timeline.
Carousel
Announcing: Baba's Sausage Expedition, the Puzzle Game Masterpieces bundle
Baba Is You
Stephen's Sausage Roll
A Monster's Expedition
Get 20% off any of these you don't already own on Steam, plus a further discount during the Steam Winter Sale
12
346
771
That concludes the 25 Years Highlight series, but make sure to check the test for more puzzles that I haven't been able to post here!
logicmastersindia.com/2020/11P/
1
[25 Years Highlight series]
No-Touch Nurikabe: Nurikabe. No islands touch even diagonally.
Solving link: swaroopg92.github.io/penpa-edit/?m=
[25 Years Highlight series]
Poset Futoshiki: Place 1-7 into the cells, each row/column has every number once. X < Y means there is a path from X to Y in the diagram (second image) that strictly goes to the right.
Solving link: swaroopg92.github.io/penpa-edit/?m=
1
1
1
[25 Years Highlight series]
All-3 Skyscrapers: Skyscrapers. All outside 3s have been given.
Solving link: swaroopg92.github.io/penpa-edit/?m=
1
[25 Years Highlight series]
Mysterious Fillomino: Fillomino. But there is a variant in effect; figure out from the example (second image).
Solving link: swaroopg92.github.io/penpa-edit/?m=
[25 Years Highlight series]
Surveyors Heyawake: Heyawake. In each room, one clue is a Heyawake clue, the other is a Minesweeper clue (counts number of black cells in 3x3 region centered on itself).
Solving link: swaroopg92.github.io/penpa-edit/?m=
1
[25 Years Highlight series]
Abacus Kurotto: Kurotto. Thermometers read black segments from the bulb like in Nonogram, e.g. "2 blacks, then 3 blacks, then 1 black"; all thermometers read the same sequence of black segments.
Solving link: swaroopg92.github.io/penpa-edit/?m=
[25 Years Highlight series]
Maximal Archipelago: Shade cells so a) no two blacks share a side, b) all whites are connected, c) you can't shade more without violating a) or b). X's must be white. Numbers count black cells in the row/coluimn.
Solving link: swaroopg92.github.io/penpa-edit/?m=
1
[25 Years Highlight series]
Greener Grasses: Divide into regions of 3 such that no region is adjacent to another region that contains all its letters. (e.g. AA cannot be adjacent to AAB but can be adjacent to AC.)
Solving link: swaroopg92.github.io/penpa-edit/?m=
1
1
My contest 25 Years on LMI has concluded; thank you for participating! I will be posting some of my favorite puzzles individually here over the coming days.
My LMI test to celebrate my 25th birthday, 25 Years, is now up! You have around 5 days (6-11 November) to start the test, where you have 125 minutes to solve 25 puzzles. Check it here:
logicmastersindia.com/2020/11P/
1
1
I'm writing an upcoming LMI test: 25 Years, to celebrate my 25th birthday. You can see the IB on the contest page: logicmastersindia.com/2020/11P/
Typed Logic, a LMI puzzle test by Puzzlers Club, is arriving this weekend (17-22 July)! Based on the Pokemon types, this test offers 18 puzzles written by various members of the community. Check out the Instructions Booklet: logicmastersindia.com/2020/07P/
1
6
This entry won the Haisu installment Logic Showcase in Puzzlers Club, where people submit a Haisu puzzle and then vote for their favorite entries. This entry also happens to be the easiest among all 13 entries; there was a 29x29 entry.
1
Show this thread
Haisu: Draw a directed line from S to G visiting all cells and not touching/crossing itself. Clue N indicates the path visits it on the N-th entry into the room.
2
7
Show this thread
Yajisan-Kazusan.
puzz.link/p?yajikazu/8/8
I've barely solved any and I don't think I've ever written one, so this was a strange experience. Not my proudest creation but I'll take it. I streamed the construction in Puzzlers Club, getting some useful suggestions.
3
If this looks impenetrable, try looking at the penalty method that I just posted a moment ago. (The second half of the thread walks through this puzzle, so spoiler warning.)
Quote Tweet
This thread is about a global Heyawake/Heyawacky deduction, when you have a near-maximum number of black squares on the grid. This is not mine; I'll quote the the original at the end of this thread (to avoid spamming mentions).
This applies to Heyawake on rectangular grids.
Show this thread
Show this thread
This thread is taken from 's observation about this exact same penalty method, although there it's only used for even x even grid. After Puzzlers Club shared about this, I translated, generalized, and reorganized it. (The 7x8 puzzle is my creation.)
1
1
2
Show this thread
Finally, we finish with standard Heyawake deductions.
1
1
Show this thread
Using more standard Heyawake deductions, we need to avoid the line crossing two boundaries in column 3. This causes a deduction in column 1 to avoid loops.
1
1
Show this thread
We still have more, this time avoiding loops.
1
1
Show this thread
Now, this means the left side is missing at least one black square from the maximum possible. This is our penalty. Now we have matched all our penalties, so we can't make any more:
- Corners are all black
- Top and right side are determined (to fit maximum blacks)
1
1
Show this thread
Look at top-left region. If the corner was white, it would contribute 2 penalties: one to K (white corner) and one to M (L-trimino empty). So the corner is black.
1
1
Show this thread
With R=7, C=8, the threshold here is 58. We have 19 black cells; this leaves 1 penalty. (We also know we can't have more black cells, since each black cell takes away 3 penalties, but we only have 1.)
1
1
Show this thread
Here is an example puzzle that we will walk through using this penalty method.
puzz.link/p?heyawake/8/7
1
1
2
Show this thread
Recap:
R,C = dimensions
X = # corner blacks
Y = # edge blacks
Z = # internal blacks
Threshold = (R-1)(C-1)+2ceil(R/2)+2ceil(C/2)
Penalties:
K = # corner whites
M = # wasted edges
N = # non-redundant loops
# penalties = threshold - 3 * # blacks
1
2
3
Show this thread
(Formally, N is the minimum number of edges you need to remove to make it a tree. Equivalently, record loops you find in the graph, but each loop must use a new edge that hasn't been used by previous loops, otherwise it doesn't count.)
1
1
Show this thread
Recall that N = # of edges - # of vertices + 1. This counts the number of "non-redundant" loops of white cells. Here (lower-left), there are 3 loops, but only 2 are non-redundant. Pick any 2, and the third is deducible from the two. So here N=2.
1
1
Show this thread
As an example, here M=4:
- Bottom-left L-trimino is all white
- Top-left domino is all white
- Left side has a missing black
- Right side has a misplaced black (making it impossible to fit the necessary 2 black squares)
1
1
Show this thread
K is simply corners that fail to be black, i.e. white corners.
M is # of blacks less from the maximum. This means:
- each L-trimino on corner that is all white
- each domino on even-length side is all white
- each missing/misplaced black on odd-length side
1
1
Show this thread