Algorithm::Pair::Best 1.010
Sponsored Links
Algorithm::Pair::Best 1.010 Ranking & Summary
File size:
0.010 MB
Platform:
Any Platform
License:
Perl Artistic License
Price:
Downloads:
898
Date added:
2007-05-17
Publisher:
Reid Augustin
Algorithm::Pair::Best 1.010 description
Algorithm::Pair::Best is a Perl module to select pairings (designed for Go tournaments, but can be used for anything, really).
SYNOPSIS
use Algorithm::Pair::Best;
my $pair = Algorithm::Pair::Best->new( ? options ? );
$pair->add( item, ? item, ... ? );
@pairList = $pair->pick( ? $window ? );
After creating an Algorithm::Pair::Best->new object, add a list of items (players) to be paired. add connects the new items into a linked list. The linked list must consist of an even number of items or youll get an error when you try to pick the pairs.
Pairings are determined partially by the original order items were added, but more importantly, items are paired based on scores which are determined by an info hash used to attach any random data to the item, and user supplied functions to provide a score for each item in relation to other items. It may be convenient to add access methods to the Algorithm::Pair::Best package from the main namespace (see the scoreSubs option to new below for an example).
Algorithm::Pair::Best->pick explores all combinations of items and returns the pairing with the best (highest) score. This can be an expensive proposition - the number of combinations goes up very fast with respect to the number of items:
items combinations
2 1 (1)
4 3 (1 * 3)
6 15 (1 * 3 * 5)
8 105 (1 * 3 * 5 * 7)
10 945 (1 * 3 * 5 * 7 * 9
12 10395 (1 * 3 * 5 * 7 * 9 * 11)
14 135135 (1 * 3 * 5 * 7 * 9 * 11 * 13)
It is clearly unreasonable to try to pair a significant number of items. On my system it takes about 2 seconds to pair 12 items (6 pairs), and 20 seconds to pair 14 items (with no negative scores only optimization). Trying to completely pair even 30 items would take too long.
Fortunately, there is a way to get pretty good results for large numbers, even if theyre not perfect. Instead of trying to pair the whole list at once, Algorithm::Pair::Best->pick pairs a series of smaller groups to get good local results. The new method accepts a window option to limit the number of pairs in each window. The window option can also be overridden by calling pick with an explicit window argument:
$pair->pick($window);
See the description of the window option below.
SYNOPSIS
use Algorithm::Pair::Best;
my $pair = Algorithm::Pair::Best->new( ? options ? );
$pair->add( item, ? item, ... ? );
@pairList = $pair->pick( ? $window ? );
After creating an Algorithm::Pair::Best->new object, add a list of items (players) to be paired. add connects the new items into a linked list. The linked list must consist of an even number of items or youll get an error when you try to pick the pairs.
Pairings are determined partially by the original order items were added, but more importantly, items are paired based on scores which are determined by an info hash used to attach any random data to the item, and user supplied functions to provide a score for each item in relation to other items. It may be convenient to add access methods to the Algorithm::Pair::Best package from the main namespace (see the scoreSubs option to new below for an example).
Algorithm::Pair::Best->pick explores all combinations of items and returns the pairing with the best (highest) score. This can be an expensive proposition - the number of combinations goes up very fast with respect to the number of items:
items combinations
2 1 (1)
4 3 (1 * 3)
6 15 (1 * 3 * 5)
8 105 (1 * 3 * 5 * 7)
10 945 (1 * 3 * 5 * 7 * 9
12 10395 (1 * 3 * 5 * 7 * 9 * 11)
14 135135 (1 * 3 * 5 * 7 * 9 * 11 * 13)
It is clearly unreasonable to try to pair a significant number of items. On my system it takes about 2 seconds to pair 12 items (6 pairs), and 20 seconds to pair 14 items (with no negative scores only optimization). Trying to completely pair even 30 items would take too long.
Fortunately, there is a way to get pretty good results for large numbers, even if theyre not perfect. Instead of trying to pair the whole list at once, Algorithm::Pair::Best->pick pairs a series of smaller groups to get good local results. The new method accepts a window option to limit the number of pairs in each window. The window option can also be overridden by calling pick with an explicit window argument:
$pair->pick($window);
See the description of the window option below.
Algorithm::Pair::Best 1.010 Screenshot
Advertisements
Algorithm::Pair::Best 1.010 Keywords
Best 1.010
can be used
can be
to pair
to select
Perl module
Go tournaments
for anything
items
1
window
3
pair
pick
Algorithm::Pair::Best
AlgorithmPairBest
Bookmark Algorithm::Pair::Best 1.010
Algorithm::Pair::Best 1.010 Copyright
WareSeeker periodically updates pricing and software information of Algorithm::Pair::Best 1.010 full version from the publisher, so some information may be slightly out-of-date. You should confirm all information before relying on it. Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future development of Algorithm::Pair::Best 1.010 Edition. Download links are directly from our publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed
Featured Software
Want to place your software product here?
Please contact us for consideration.
Contact WareSeeker.com
Related Information
can be used to heat large amounts of liquid
items tagged with
promotional items
items that have
items allowed on airplanes
items from many
baby items
windows messenger
items needed for fire cape
perl modules
who could ask for anything more
sit and go tournaments
items wanted
diablo 2 items
windows xp
items for sale
items on ebay
windows media player 11
Related Software
Algorithm::Loops is a Perl module with looping constructs: NestedLoops, MapCar*, Filter, and NextPermute*. Free Download
Algorithm::CurveFit - Nonlinear Least Squares Fitting. Free Download
Algorithm::Diff is a Perl module to compute `intelligent differences between two files / lists. Free Download
Algorithm::SixDegrees is a Perl module that can find a path through linked elements in a set. Free Download
Algorithm::Permute is a Perl module with handy and fast permutation with object oriented interface. Free Download
Algorithm::LUHN is a Perl module to calculate the modulus 10 double add double checksum. Free Download
Algorithm::DiffOld is a Perl module to compute `intelligent differences between two files / lists but use the old interface. Free Download
Algorithm::BinPack is a Perl module that can efficiently pack items into bins. Free Download
Latest Software
Popular Software
Favourite Software