Algorithm::Metric::Chessboard

Algorithm::Metric::Chessboard is a Perl module that enables the calculation of distances on an optional square grid with wormholes. This is achieved through the use of the 'chessboard metric' which calculates the minimum number of moves required to get from one point to another in a game played on a square grid, whereby one move entails jumping from a point to a horizontal, vertical, or diagonal neighbour.

At its most basic level, the number of moves required to go from one point to another (let's say between (x1, y1) and (x2, y2)) would be easily determined through: d( (x1, y1), (x2, y2)) = max( abs( x1 - x2 ), abs( y1 - y2)). However, within the space lies 'wormholes' which allow for the travel between two distant points. This means that the actual number of moves required may be lower than that determined through the above equation. The cost of wormhole travel has a fixed number of moves associated with it.

In order to implement the above-mentioned functionalities, the Perl module utilizes the following SYNOPSIS: my @wormholes = (
Algorithm::Metric::Chessboard::Wormhole->new( x => 5, y => 30 ), Algorithm::Metric::Chessboard::Wormhole->new( x => 98, y => 99 ), );
my $grid = Algorithm::Metric::Chessboard->new( x_range => [ 0, 99 ], y_range => [ 0, 99 ], wormholes => @wormholes, wormhole_cost => 3, );
my $wormhole = $grid->nearest_wormhole( x => 26, y => 53 );
my $journey = $grid->shortest_journey(start => [1, 6], end => [80, 1]);

Overall, Algorithm::Metric::Chessboard is a highly effective Perl module that enables users to determine the shortest journey required to travel between two points on a square grid, taking into account the presence and cost of wormholes. The module is easy to navigate and can be a great addition to any software suite requiring distance calculations.