New answers tagged

5 votes
Accepted

Largest word tree

I wrote a computer progam for this problem. It found the following tree: The program works relatively straightforwardly. First it puts all the words in a tree structure. Then it prunes all the ...
user avatar
22 votes
Accepted

Two mystical trees

Reassembled tree: Words:
user avatar
  • 8,742
4 votes

D&D dice for literary people

user avatar
  • 4,074
4 votes
Accepted

D&D dice for literary people

How about like this
user avatar
  • 8,775
5 votes

Efficient Mowing at PSE

Because of the [no-computers] tag, I waited to post this answer until somebody else already proved optimality. A graph-based approach to this problem is to first compute all-pairs shortest-path ...
user avatar
  • 8,998
23 votes

Efficient Mowing at PSE

Proof of optimality for the solutions given
user avatar
  • 20.8k
9 votes

Efficient Mowing at PSE

Here's a path that uses just 111 mows: Proof of optimal starting and ending points and lower bound:
user avatar
  • 7,162
12 votes
Accepted

Efficient Mowing at PSE

Others of the same length exist, such as this, this and SQLNoob's, and several more. Proof of optimality (see FlorianF's for a more concrete proof: TL;DR:
user avatar
1 vote

Efficient Mowing at PSE

I was able to get 111 moves (assuming I counted correctly):
user avatar
  • 1,178
4 votes

Efficient Mowing at PSE

I got 112 squares (assuming I counted correctly), visiting every one: However, this is not optimal.
user avatar
2 votes

Efficient Mowing at PSE

Here is a pretty long path that does not visit any square twice, but misses a few spots: To turn this into a solution, we have to add a few extra moves to mow those missed spots: That gives a total ...
user avatar

Top 50 recent answers are included