The goal is to create 7 paths, one from each letter at the top (e.g., A, B, C, etc.) to the same letter at the bottom. [br][br]To complete the goal, horizontal lines must be positioned between neighboring vertical lines (just click and drag, or click and use arrow keys, to move). [br][br]Paths start at the top, move only downward along the vertical lines, and end when they reach a letter at the bottom. When a horizontal line is met, however, paths must follow it across to the adjacent vertical line, and then continue moving downward until either another horizontal line is met, or until a letter at the bottom is finally reached.[br][br]If all of the horizontal lines are positioned correctly, the message, "Solved", will appear at the top. Reloading the applet will randomly generate a new puzzle.[br][br]Challenge: derive a way for determining the minimum number of horizontal lines required. Hint: replace the letters A through G, with the numbers 1 through 7, and look for a pattern.[br][br]In case you're wondering, yes, an algorithm does exist for determining a minimal solution, without any trial and error at all.