Blind Algorithm

This simple version of blind algorithms belongs to the stochastic methods, which search the space of possible solutions in a random direction. Because it uses a clear random search, the algorithm frequently gets stuck in a local extremum. The basic version functions so that it always starts from a random point in the space of possible solutions. For the momentarily proposed solution, a comparison with the previous one is done and only the better one is remembered (a red line when the "time series" button is used). The solutions at each iteration are dots on the cost function landscape. The best solution for each iteration is marked by a thick dot with black circle. Different colors represents different iterations; in order: red, light pink, green, light yellow, blue, light orange, cyan, black, light cyan, magenta, yellow, light brown, orange, light purple, brown, light red, white, pink, purple, light green and light blue.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.