# Tag Info

10

5

1

1

Helper picture: Tour 1 with endpoints type 1 and 6: Tour 2 with endpoints type 2 and 5: Tour 3 with endpoints type 3 and 4: Strategy used:

5

I believe the first pattern is (with (0,0) at top left) And the last is (with (0,0) at top left) where The question has been updated to include a request to "explain your answer". I don't have much explanation to offer for the first pattern. I just I can say a little more about the fourth.

4

(2 out of 4) $(0,0)$ is bottom left, not top left. 2nd pattern: 3rd pattern:

0

Here is my 10 letter word: Shearlings shearlings: skin from a recently sheared sheep or lamb that has been tanned and dressed with the wool left on shearling: skin from a recently sheared sheep or lamb that has been tanned and dressed with the wool left on shearing: to cut off the hair from hearing: the process, function, or power of perceiving sound ...

2

I found a solution in only 8 intermediate steps: It is possible that shorter paths still exists, because I couldn't obtain the complete MW dataset. Methodology: First obtained a word list aspell -d en dump master | aspell -l en expand > words.en.txt Keep only words that are 5 letters long awk 'length(\$0)== 5' wordlist1.txt > wordlist2.txt Kepp ...

4

The solution is The first step is to notice something about the 3x3 squares on the outside. Specifically, Applying that logic gives us our first step: From there, you can get the next little bit done with very basic Sudoku logic This was about when I had to start writing down the possibilities in each square, but I never had to resort to any of the more ...

11

If deletions and insertions are allowed, it is possible in 7 steps:

37

Based on ThatOneNerdyBoy's answer, here's a 9-step solution in which all words are contained within MW

13

Here is a possible 9 step:

18

Here it is in 10 steps, at least

13

Solution: Method:

1

Let the digits be a1,a2,a3,… d4, using standard algebraic chess notation (i.e. letters = columns, numbers = rows, a1 = lower left).

3

Solution: Reasoning:

3

I randomly encountered this problem and I think I have a simpler solution (for the special kudos version) than Gareth's:

9

I think the answer is (Partial) Explanation: As a bonus, a computer-based proof that the solution is unique (Python + Z3Py):

13

Here is my attempt at solving this:

Top 50 recent answers are included