UNPKG

battleship-search

Version:

maximize an n-dimensional landscape using the battleship search algorithm

7 lines (6 loc) 171 B
hyperplane bump out each point in term polygon with (number of dimensions)+1 instead of a triangle -> creates (n+1) new regions initialization smoothing recursion