bakpao's puzzles

 Two classic Disorderly Loop puzzles, a relatively new genre created by Eric Fox . Constructing a decent puzzle in this genre feels rather tricky, which I think shows in the first puzzle, which perhaps feels slightly cluttered. Overall, however, I think these are fairly nice for a first attempt at setting the genre. Difficulty: 2/5 for the first, 3/5 for the second (rules from Puzzle Rules ) Draw a non-intersecting loop through the centers of some cells. Clued cells may not be used by the loop. Clues represent the lengths of the next N line segments appearing in the loop, not necessarily in order, starting with a line in the cell adjacent to the clue in the direction of its arrow and moving in the direction of the arrow, where N is the amount of numbers in the clue. Puzzle #1 - Penpa:  https://tinyurl.com/3j95j4yx Puzzle #2 - Penpa:  https://tinyurl.com/2axbt8mx

Two variant Simple Loops, using the Skyscraper variation. The first puzzle was an entry to our first speedsetting session of the year in the CTC Discord server, taking 2nd place. It inspired me to set a bigger one with more complex logic, without the time pressure of a speedset. While the puzzles are similar in appearance, they have very different solve paths. Difficulty: 2/5 for the first, 3.5/5 for the second Rules: Draw a single, non-intersecting loop through the center of all cells in the grid. Also, numbers outside the grid show the number of separate loop segments visible in that direction. A segment of length N in a given direction is taken as a building of height N. Buildings of height N block the view of all buildings behind them of equal or lesser height. Puzzle 1 (Penpa):  https://git.io/JSDIo Puzzle 2 (Penpa):  https://git.io/J9sV1

    A classic Chat Room puzzle. Should be on the easier side. This was originally set for another project, but proved unsuitable, so I'm posting it here instead. Difficulty: 2/5 Rules Draw lines through the centers of all cells in the grid to connect each phone to exactly one black and one white circle. Each circle must be used exactly once, and each path can connect only one circle to a phone. Numbers inside circles, when given, indicate  how often the line from that circle turns before reaching a phone. Play on penpa https://git.io/JSi78