cusack.hcg.games.pebble.algorithms

Class Utilities

java.lang.Object

cusack.hcg.games.pebble.algorithms.Utilities

public class Utilities
extends java.lang.Object

Constructor Summary

Constructors

Constructor and Description
Utilities()

Method Summary

Modifier and Type	Method and Description
static int	calculatePebblingNumber(PebbleInstance puzzle) Run the EfficientPebblingNumberExhaustive algorithm to find the pebbling number of the graph.
static int[]	calculateSingleVertexMinimumSolvableConfiguration(PebbleInstance puzzle) Computes the number of pebbles on each vertex that would guarantee solvability.
static java.lang.String	configurationToString(int[] config) Makes a string of the configuration
static java.util.ArrayList<int[]>	findAll2PPViolators(PebbleInstance puzzle, int numberOfPebbles, int numberOfVerticesWithPebbles, boolean fineThreaded)
static java.util.ArrayList<int[]>	findAllUnsolvableConfigurations(PebbleInstance puzzle, int numberOfPebbles, int numberOfVerticesWithPebbles, boolean isExtendedPuzzle) Find all unsolvable configurations of numberOfPebbles pebbles placed on numberOfVerticesWithPebbles vertices.
static int[]	findFirstUnsolvableConfiguration(PebbleInstance puzzle, int numberOfPebbles, int numberOfVerticesWithPebbles, boolean isExtendedPuzzle)

Methods inherited from class java.lang.Object

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

Constructor Detail

Utilities

public Utilities()

Method Detail

configurationToString

public static java.lang.String configurationToString(int[] config)

Makes a string of the configuration

Parameters:

config - the configuration to be made a string

Returns:

the string created

calculatePebblingNumber

public static int calculatePebblingNumber(PebbleInstance puzzle)

Run the EfficientPebblingNumberExhaustive algorithm to find the pebbling number of the graph.

calculateSingleVertexMinimumSolvableConfiguration

public static int[] calculateSingleVertexMinimumSolvableConfiguration(PebbleInstance puzzle)

Computes the number of pebbles on each vertex that would guarantee solvability. This can be used to quickly determine solvability in many cases.

findAllUnsolvableConfigurations

public static java.util.ArrayList<int[]> findAllUnsolvableConfigurations(PebbleInstance puzzle,
                                                                         int numberOfPebbles,
                                                                         int numberOfVerticesWithPebbles,
                                                                         boolean isExtendedPuzzle)

Find all unsolvable configurations of numberOfPebbles pebbles placed on numberOfVerticesWithPebbles vertices. If isExtendedPuzzle is true we assume the puzzle is such that the second half of the vertices were added using addExtensionVertices from PebbleInstance and that we should not place pebbles on them. In other words we are trying to determine if a graph has 2PP.

Parameters:

puzzle -

numberOfPebbles -

numberOfVerticesWithPebbles -

isExtendedPuzzle -

Returns:

findFirstUnsolvableConfiguration

public static int[] findFirstUnsolvableConfiguration(PebbleInstance puzzle,
                                                     int numberOfPebbles,
                                                     int numberOfVerticesWithPebbles,
                                                     boolean isExtendedPuzzle)

findAll2PPViolators

public static java.util.ArrayList<int[]> findAll2PPViolators(PebbleInstance puzzle,
                                                             int numberOfPebbles,
                                                             int numberOfVerticesWithPebbles,
                                                             boolean fineThreaded)