search.cpan.org is shutting down
J. J. Merelo-Guervós > Algorithm-MasterMind-v0.4.5 > Algorithm::MasterMind::Sequential_Alt

Algorithm-MasterMind-v0.4.5.tar.gz

Dependencies

Annotate this POD

# CPAN RT

 Open 1
View/Report Bugs
Module Version: 1.003

# NAME

Algorithm::MasterMind::Sequential_Alt - Tests each combination in turn, alternating with the beginning and end of the sequence.

# SYNOPSIS

```    use Algorithm::MasterMind::Sequential_Alt;

my @alphabet = qw( A B C D E F );
my \$solver = new Algorithm::MasterMind::Sequential_Alt { alphabet => \@alphabet,
length => length( \$secret_code ) };```

# DESCRIPTION

Test combinations in turn, starting by A x length. Should find the solution, but complexity increases with size. Not very efficient, but a bit better than Algorithm::MasterMind::Sequential

# INTERFACE

## initialize()

Called from base class, mainly

## new ( \$options )

This function, and all the rest, are directly inherited from base

## issue_first ()

Issues the first combination, which might be generated in a particular way

## issue_next()

Issues the next combination

## feedback()

Obtain the result to the last combination played

## guesses()

Total number of guesses

## number_of_rules ()

Returns the number of rules in the algorithm

## rules()

Returns the rules (combinations, blacks, whites played so far) y a reference to array

## matches( \$string )

Returns a hash with the number of matches, and whether it matches every rule with the number of blacks and whites it obtains with each of them

## next_string( \$string )

Computes the next string taking into account the limited alphabet, and return the computed string

## prev_string( \$string )

Computes the previous string taking into account the limited alphabet, and returns it.

## prev_letter ( \$character )

Returns the previous letter considering the limited alphabet. Needed because magic auto-decrement does not work.

# AUTHOR

JJ Merelo `<jj@merelo.net>`

Copyright (c) 2009, JJ Merelo `<jj@merelo.net>`. All rights reserved.