dpadawer
Farmer’s Loop
Place a letter into some cells of the grid so that all letters form one orthogonally connected area. Every run of two or more letters in consecutive cells in a row or column forms a word reading from left to right or top down. All words are given outside the grid and must each appear exactly once.
Draw a directed loop through some orthogonally adjacent cells of the grid. The loop must pass through every E and I, and may optionally pass through any number of Cs. The loop may not pass through any other letters. The loop cannot turn while passing through a letter. The loop must pass through an I immediately before passing through an E, unless it has just passed through a C.
Every cell inside of the loop must contain a letter.
Two example puzzles with their solutions (click to solve on Penpa+):
Solution to example 1
Click the image to solve on Penpa+.
