Skip to content

Instantly share code, notes, and snippets.

@sakamotodesu
Created November 28, 2012 04:49
Show Gist options
  • Save sakamotodesu/4159080 to your computer and use it in GitHub Desktop.
Save sakamotodesu/4159080 to your computer and use it in GitHub Desktop.
Issues that have been questions in math TV show Takeshi Kitano (04/09/2012)

Q. There is a computer that is programmed to draw a locus of points starting from the point A on grid 8 × 8. The point we move on to the next random point up, down, left, and right. We will not be able to move again on the trail drawn already, however. The point is able to straight any number of times, but turning is up to 15 times. Find the longest distance of the trajectory of this computer may be drawn.

       p   p   p   p   p   p   p   p

       p   p   p   p   p   p   p   p

       p   p   p   p   p   p   p   p

       p   p   p   p   p   p   p   p

   A - s   p   p   p   p   p   p   p

       p   p   p   p   p   p   p   p

       p   p   p   p   p   p   p   p

       p   p   p   p   p   p   p   p

A. 76 times

               |
       @ - p - p - p - p - @   p   p
       |       |           |
       p   @ - p - p - p - p - p - @
       |   |   |           |       |
       @ - p - p - p - p - p - @   p
           |   |           |   |   |
       @ - p - p - p - p - p - p - @
       |   |   |           |   |
   A - s - p - p - p - p - p - p - @
       |   |   |           |   |   |
       p   p   @ - p - p - @   p   p
       |   |                   |   |
       @ - p - p - p - p - p - @   p
           |                       |
       p   @ - p - p - p - p - p - @ 

However, it has not been proven whether the maximum is 76 times, there may be a larger locus.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment