public StochasticHillClimbSearcher(HillClimbSearcher searcher, int seed = 0)
        {
            if (seed == 0)
                _rand = new Random();
            else
                _rand = new Random(seed);

            Searcher = searcher;

            Attempts = 256;
            Threads = 1;
        }
        public StochasticHillClimbSearcher(HillClimbSearcher searcher, int seed = 0)
        {
            if (seed == 0)
            {
                _rand = new Random();
            }
            else
            {
                _rand = new Random(seed);
            }

            Searcher = searcher;

            Attempts = 256;
            Threads  = 1;
        }
Ejemplo n.º 3
0
 public BestFirstSearcher(HillClimbSearcher improver = null)
     : base(improver)
 {
 }
 public ConstructiveSearcher(HillClimbSearcher improver = null)
 {
     Improver = improver;
 }
 public WorstFirstSearcher( HillClimbSearcher improver = null )
     : base(improver)
 {
 }
Ejemplo n.º 6
0
 public BestestFirstSearch(HillClimbSearcher improver = null)
     : base(improver)
 {
     _testRoute = null;
 }
 public BestestFirstSearch( HillClimbSearcher improver = null )
     : base(improver)
 {
     _testRoute = null;
 }
 public ConstructiveSearcher( HillClimbSearcher improver = null )
 {
     Improver = improver;
 }