hipster-problem-builder.java

// Builder example with Hipster
Hipster.SearchProblem p =
            ProblemBuilder.create()
                .initialState(initialState)
                .defineProblemWithExplicitActions()
                    .useActionFunction(af)
                    .useTransitionFunction(atf)
                    .useCostFunction(cf)
                    .useHeuristicFunction(hf)
                    .build();

// Control A* algorithm in an iterative fashion
for(Node n : Hipster.createAStar(p)){
  if (n.state().equals(...) { ... }
}