Avoiding local minimums

The problem of local minimum detected in the last post has been improved

by widening the search (widening the random increases range) and by detecting deep minimums

with a timeout (seconds in the minimum).

This and a higher increase of the the inputs when escaping from bad circumstances (input set in which all input probabilities not assigned at 0 and 1 will increase the entropy no mater to what side we balance these inputs) has speed up the algorithm.

[1] [ Forced Satisfiable CSP and SAT Benchmarks of Model RB - A Simple Way for

Generating Hard Satisfiable CSP and SAT Formulas

http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/benchmarks.htm (frb30-15-cnf.tar.gz)]