Knight's_graph_showing_number_of_possible_moves.svg
Size of this PNG preview of this SVG file:
600 × 600 pixels
.
Other resolutions:
240 × 240 pixels
|
480 × 480 pixels
|
768 × 768 pixels
|
1,024 × 1,024 pixels
|
2,048 × 2,048 pixels
|
2,700 × 2,700 pixels
.
Summary
Description Knight's graph showing number of possible moves.svg | Knight's graph showing the number of possible moves from each node | ||
Date | |||
Source | Own work | ||
Author | R. A. Nonenmacher | ||
Permission
( Reusing this file ) |
I, the copyright holder of this work, hereby publish it under the following licenses:
This file is licensed under the
Creative Commons
Attribution-Share Alike
Attribution-Share Alike 4.0 International
,
3.0 Unported
,
2.5 Generic
,
2.0 Generic
and
1.0 Generic
license.
You may select the license of your choice.
|
||
Other versions |
|
||
SVG development
InfoField
|
This W3C-
invalid
diagram was created with
Adobe Illustrator
.
This diagram uses
embedded
text that can be
easily translated
using a text editor.
|
Original upload log
The original description page was
here
. All following user names refer to en.wikipedia.
- 2008-06-23 13:05 Nonenmac 270×270 (20464 bytes) shifted numerals down and to the left a bit, and reduced font size from 12 to 11.
- 2008-06-23 02:53 Nonenmac 270×270 (20635 bytes) Increased viewbox size to avoid clipping at edges
- 2008-06-23 02:42 Nonenmac 267×267 (20583 bytes) Graph showing all possible paths in the 8x8 [[Knight's tour]] problem. Created by me using Adobe Illustrator and a text editor.