[seqfan] Ascension optimization framework

[Peter Karpov]

Hello SeqFans,
I'd like to share a tool I've been working on for quite some time, a  
metaheuristic optimization framework:  
https://github.com/inversed-ru/Ascension . In short, it is a  
general-purpose optimizer. The current public version comes with four  
algorithms: local search, tabu search, simulated annealing and the genetic  
algorithm.

Many integer sequences come from problems involving optimization. A nice  
example is peaceable queens, A250000. Ascension makes it easy to  
experiment with such problems. Here is a list of sequence-related problems  
implemented so far:

A250000     Peacable Queens
A055397     Maximal density still life
A068940     3D N Queens
A075458     Queen domination
A001366     Nondominating queens
A006075     Knight covering
A240443     Maximal density subsquare-free arrangements
A227133     Maximal density axis-aligned subsquare-free arrangements

Let me know if you know any other interesting problems that I can  
implement. Or you can follow the N queens example and define new problems  
yourself.

-- 
Peter Karpov