Solution:
It is a pretty easy slitherlinkSlitherlink, many basic techniques can are applied. (yes, it has a unique solution.)
Explanation:
Starting with the most basic one, mark the lines around 0's as X's, and if a point has only one direction to go (e.g. the 2 touching corners in 2 adjacent 0's), mark that corresponding part as X. After that, draw the lines in the numbers that have enough X's surrounding it.
Notice a 2 in the corner. There are 2 possible ways to draw the lines:
We can deduce that 2 lines can be drawn that must be going away from 2 at the border (highlighted in red). We can draw more lines using Slitherlink logic:
A little bit more logic:
A bit of a tricky part. Notice the point marked in bold. If the line moves to east (orange), it would create another line surrounding it, which is a contradiction.
If the line moves to south (blue), the resulting line becomes a dead-end, since it cannot access the other loop segments to the right.
Concluding that the line moves west and using some more basic logic, the Slitherlink is complete.
