Introductory Reflect Link

Introductory in the sense that it's very easy, not in the sense that it's this blog's first puzzle of the kind. What fun would doing things in order be?

Draw a single loop through some cells of the grid. All places where the loop crosses over itself are given, and the loop goes straight at all such intersections. Some loop corners are marked. On some of these marks the number of cells occupied by the corner is given.

An introductory Reflect Link

Yes, that's another pattern breaking kludge.

Reflect link

Another Nikoli experiment. Draw a loop joining orthogonally adjacent cell centres. All points where straight loop segments intersect are given as crosses, and must be visited. The loop may not touch itself (stop sniggering) at any other point or way. The loop must visit all cells with triangles, and must turn at those points. Some of these triangles may be marked with a number, which indicates the total number of cells visited by the straight loop segments meeting there.

I have never actually seen one of these problems before in any medium, so I have no idea how close these are to the typical problem of this sort. The first one is an easy introduction to the rules, the second one is just a bit meatier.