Combination tapa

Thanks to Zoltan horvath for testing this one.

TVC X puzzles

This post contains 6 puzzles picked up from the IB available at LMI .One of my ideas is also appearing at this test.I am not very fond of the Difference tapa, as i thought it is just a specific case of math tapa.I didnt mind creating one though.I think the "only 2 blocks per clue" property probably makes up the major solving key for these puzzles.There is an 'x' in the top-left corner to eliminate the possibility of shading either of two cells.
I am glad tapa guard is back,this being the most interesting of tapa variations.
the Shortest Segment i posted here is the only sample i ever made,as this idea is one of the most recent.It was also used in the IB.I have mixed opinion about braille tapa.Like it for some reasons and do not for some.As for toroidal tapa,I never liked toroidal grids.
Hope you liked these puzzles.

Edit: Braille and total false modified for uniqueness.

Tapa Guard




Combination tapa




Difference tapa





Total false





Shortest Segment




Braille Tapa

Tapa packing

Rules:Paint some cells black to create a continuous wall.Number/s in a cell indicate the lengths of black cell blocks on its neighbouring cells.If there is more than one number in a cell,there must be atleast one white cell between the black cell blocks.Painted cells cannot form a 2x2 square or larger.There are no wall segments on cells containing numbers.Every outlined region must contain exactly two blocks of shaded cells.
Below is an example with its solution.

Shikaku - easy

The easiest puzzle on this blog.
I think beginners would enjoy it anyway.

Rules: Divide the grid into non-overlapping rectangles,every rectangle containing exactly one numbered circle,the number indicating the area of the rectangle.

Anuraag's island - easy

This is Anuraag's island

Snake in Heterocut

This is a hybrid of snake and heterocut.

Rules

Snake in Heterocut

This puzzle is one of the many new puzzle variations you would find originally on this blog.

Rules: Place a snake of 1-cell width,that does not touch itself,not even diagonally.Head and tail are given.Then divide all the remaining cells into polyominos of areas 2 ,3,4, or 5.Arrows always point to the larger region.No two polyominos can be identical,even after rotation/reflection.Every pair of cells having an arrow between them always belong to polyominos,and not the snake. Numbers outside indicate the quantity of cells occupied by the snake in the corresponding direction.

Akari - hard

The difficulty is too high for the size of the grid.

No-touch Nurikabe - hard

Here is another No-touch Nurikabe.
When i started designing it,I didnt know i would have to add an ugly water mark in the end.

LIliTS - medium

This is a LIliTS puzzle.