public class

EightQueensProblemExampleWithAnnealingSearch

extends Object
java.lang.Object
   ↳ es.usc.citius.hipster.examples.EightQueensProblemExampleWithAnnealingSearch

Class Overview

Example using the N-Queens problem (size 8x8) solved using the Annealing search. This example is a search problem with no explicit actions, only using a transition function which generates from a state a set of successor states. The cost function in this case is constant, and we assume it has no cost to move a queen. As heuristic for this problem we use the number of attacked queens. These components are defined as the same time the problem is being built (using a ProblemBuilder.

See Also
  • {@link es.usc.citius.hipster.examples.problem.NQueens}

Summary

Public Constructors
EightQueensProblemExampleWithAnnealingSearch()
Public Methods
static void main(String[] args)
[Expand]
Inherited Methods
From class java.lang.Object

Public Constructors

public EightQueensProblemExampleWithAnnealingSearch ()

Public Methods

public static void main (String[] args)