|
Search: id:A072174
|
|
|
| A072174 |
|
Maximum path length of a crippled knight on an n X n board. |
|
+0
1
|
| |
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
A crippled knight moves one square vertically and two horizontally (or vice versa) and can't land on or pass over any square on which it is previously rested. The initial placement counts as the first move. a(8)>=49.
|
|
REFERENCES
|
A crippled knight is defined in the Journal of Recreational Mathematics, problem 2465, Vol. 29 #4 and Vol. 30 #4 has an example for 8 X 8.
|
|
EXAMPLE
|
For 3 X 3, the longest path is 1 0 3/4 0 0/0 2 5, so a(3)=5.
|
|
CROSSREFS
|
Sequence in context: A165594 A023497 A105600 this_sequence A020958 A020750 A020713
Adjacent sequences: A072171 A072172 A072173 this_sequence A072175 A072176 A072177
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Jud McCranie (j.mccranie(AT)comcast.net), Jun 29 2002
|
|
|
Search completed in 0.002 seconds
|
