cusack.hcg.games.pebble.algorithms.deprecated

Class PebblingNumberSuperSkip

java.lang.Object

cusack.hcg.graph.algorithm.AbstractAlgorithm<PebbleInstance>

cusack.hcg.games.pebble.algorithms.PebbleAlgorithm

cusack.hcg.games.pebble.algorithms.deprecated.PebblingNumberExhaustiveGeneric

cusack.hcg.games.pebble.algorithms.deprecated.EfficientPebblingNumberExhaustive

cusack.hcg.games.pebble.algorithms.deprecated.PebblingNumberSuperSkip

All Implemented Interfaces:

AlgorithmInterface<PebbleInstance>

Direct Known Subclasses:

PebblingNumberSuperSkipNoEvens

Deprecated.

@Deprecated
public class PebblingNumberSuperSkip
extends EfficientPebblingNumberExhaustive

This algorithm may not be correct and is less efficient than the others. This algorithm attempts to find more configurations that can be skipped by reducing the values associated with the maxConfiguration array. Every configuration creates a new tempMaxConfiguration array which has values no greater than the values in the maxConfiguration array. It reduces the values by seeing how many pebbles it can move from each vertex to its adjacent vertices and subtracting that many pebbles from the corresponding indices in tempMaxConfiguration. It is hard to tell if this algorithm is actually more efficient than EfficientPebblingNumberNoEvens. It doesn't seem like there are very many superSkip configurations, and the overhead of checking for them every time might make this algorithm be worse.

Author:

Daniel K. Simpson?

Constructor Summary

Constructors

Constructor and Description
PebblingNumberSuperSkip() Deprecated.

Method Summary

Modifier and Type	Method and Description
boolean	belowMaximum() Deprecated.
void	computeTemporaryMaxConfiguration() Deprecated. See what pebbling moves can be made from the initial configuration.
java.lang.String	getResult() Deprecated. Return the result of the algorithm in the context of the problem.
void	initializeMoreData() Deprecated. Sets up the arrays and initial configurations for the fields of this class.
void	initializeTemporaryMaxConfiguration() Deprecated. Initialize the tempMaxConfiguration by setting its values equal to the maxConfiguration values
void	lowerLeftAdjacentVerticesTempMax(int indexOfVertex, int toLowerBy) Deprecated. Reduce the tempMaxConfiguration values by the number of pebbles that can be moved from the specified vertex to its adjacent vertices.
AlgorithmStates	nextConfiguration() Deprecated. The nextConfiguration, skipping any of the configurations that have pebbles placed on one vertex that make the graph automatically solvable.
void	tempMaxToBeginning(int toAdd) Deprecated.

Methods inherited from class cusack.hcg.games.pebble.algorithms.deprecated.EfficientPebblingNumberExhaustive

argumentFormat, getPebblingNumber, getVersion, parseArguments

Methods inherited from class cusack.hcg.games.pebble.algorithms.deprecated.PebblingNumberExhaustiveGeneric

countsOperations, getCurrentProblemData, getProgressReport, next, runAlgorithm

Methods inherited from class cusack.hcg.games.pebble.algorithms.PebbleAlgorithm

getPebbleState, getProblemType, initializeData, quit, setPebbleState

Methods inherited from class cusack.hcg.graph.algorithm.AbstractAlgorithm

getNumberOfOperations, getState, isDone, isNotDone, isQuit, setProblemData, setState

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

PebblingNumberSuperSkip

public PebblingNumberSuperSkip()

Deprecated.

Method Detail

getResult

public java.lang.String getResult()

Deprecated.

Description copied from interface: AlgorithmInterface

Return the result of the algorithm in the context of the problem. i.e. Solvable, Unsolvable, Unknown. This tells more than "Done" or "Not_Done" that is given in the more general sense. This might just be "true" or "false", it might be the encoding of a series of moves, etc.

Specified by:

getResult in interface AlgorithmInterface<PebbleInstance>

Overrides:

getResult in class EfficientPebblingNumberExhaustive

Returns:

the result

initializeMoreData

public void initializeMoreData()

Deprecated.

Description copied from class: PebblingNumberExhaustiveGeneric

Sets up the arrays and initial configurations for the fields of this class.

Overrides:

initializeMoreData in class PebblingNumberExhaustiveGeneric

nextConfiguration

public AlgorithmStates nextConfiguration()

Deprecated.

Description copied from class: EfficientPebblingNumberExhaustive

The nextConfiguration, skipping any of the configurations that have pebbles placed on one vertex that make the graph automatically solvable. In the PebblingNumberExhaustive algorithm these sorts of configurations are checked every time, but if we iterate through them we save time on larger graphs.

Returns:

DONE if the algorithm has found the pebbling number, or NOT_DONE if it sets currentConfiguration to another that needs to be checked

initializeTemporaryMaxConfiguration

public void initializeTemporaryMaxConfiguration()

Deprecated.

Initialize the tempMaxConfiguration by setting its values equal to the maxConfiguration values

computeTemporaryMaxConfiguration

public void computeTemporaryMaxConfiguration()

Deprecated.

See what pebbling moves can be made from the initial configuration. "move" the pebbles to adjacent vertices, essentially reducing the maxConfiguration for this configuration. This reduced maxConfiguration is stored in tempMaxConfiguration.

lowerLeftAdjacentVerticesTempMax

public void lowerLeftAdjacentVerticesTempMax(int indexOfVertex,
                                             int toLowerBy)

Deprecated.

Reduce the tempMaxConfiguration values by the number of pebbles that can be moved from the specified vertex to its adjacent vertices.

Parameters:

indexOfVertex - The vertex that is "moving" its pebbles.

toLowerBy - The amount to reduce the adjacent vertices tempMaxConfig by.

belowMaximum

public boolean belowMaximum()

Deprecated.

tempMaxToBeginning

public void tempMaxToBeginning(int toAdd)

Deprecated.