# Buildsheet autogenerated by ravenadm tool -- Do not edit.

NAMEBASE=		perl-Algorithm-Metric-Chessboard
VERSION=		0.01
KEYWORDS=		perl
VARIANTS=		538 540
SDESC[540]=		Calculate distances on a square grid (5.40)
SDESC[538]=		Calculate distances on a square grid (5.38)
HOMEPAGE=		none
CONTACT=		Perl_Automaton[perl@ironwolf.systems]

DOWNLOAD_GROUPS=	main
SITES[main]=		CPAN/ID:K/KA/KAKE
DISTFILE[1]=		Algorithm-Metric-Chessboard-0.01.tar.gz:main
DF_INDEX=		1
SPKGS[540]=		single
SPKGS[538]=		single

OPTIONS_AVAILABLE=	PERL_538 PERL_540
OPTIONS_STANDARD=	none
VOPTS[540]=		PERL_538=OFF PERL_540=ON
VOPTS[538]=		PERL_538=ON PERL_540=OFF

DISTNAME=		Algorithm-Metric-Chessboard-0.01

GENERATED=		yes

SINGLE_JOB=		yes

[PERL_540].USES_ON=			perl:540,configure

[PERL_538].USES_ON=			perl:538,configure

[FILE:388:descriptions/desc.single]
Calculates the minimum number of moves between two points in a game played
on a square grid, where one move is a jump from a point to a horizontal,
vertical or diagonal neighbour.  However within the space are "wormholes"
which allow you to travel between any two distant points, so the actual
number of moves may be smaller than the above. Wormhole travel costs a
fixed number of moves.


[FILE:118:distinfo]
2209527fd1b0637ca143fe4340c3466f9dd2759e2fa1de3ae6baea0d8274df16         4217 Algorithm-Metric-Chessboard-0.01.tar.gz