This is a Slitherlink puzzle.
This one might remind you of the IPC 2012 Tapa, and in fact this one is another reject from the IPC (along with 401) for being a little harder than what was needed.
This is a Slitherlink puzzle.
This one might remind you of the IPC 2012 Tapa, and in fact this one is another reject from the IPC (along with 401) for being a little harder than what was needed.
This is a Creek puzzle, with a twist. One of the grid squares has treasure in it, though its location is not given. A number in a grid cell gives the length of the shortest path to the treasure going through adjacent unshaded cells. The path length is computed as the number of grid cells used, including the two cells with the clue and the treasure. Cells with a number or treasure are unshaded.
This is a Slitherlink puzzle, with a twist. Exactly one clue in each row and column is false. Which clues are lying is up to you to determine.
This is a Nurikabe puzzle.
Update 5/23/2012 6:07 AM ET: Fixed a minor two-solution error on the right side.
This is a Slitherlink puzzle.
This is a Fillomino puzzle, with a twist. Each polyomino is the same size as exactly one other polyomino in the solution. In other words, each polyomino size is either used twice or not at all.
This is a Country Road puzzle.
Almost went an entire year without one of these… given that, perhaps a reminder is in order: I’ve always used a variant on the rules which does not require every room to be visited. This puzzle is no exception.
This is a Numberlink puzzle.
This is a Nurikabe puzzle, with a twist. It must be possible to tile all of the shaded cells by nonoverlapping 1×2 dominoes.
I got sent this nice variation idea by Jack Brennen.
This is a Masyu puzzle, with a twist. Two squares that are unused by the loop may not be adjacent (this is a rule borrowed from Yajilin).