UNPKG

battleship-search

Version:

maximize an n-dimensional landscape using the battleship search algorithm

12 lines 838 B
[{"index":0,"value":2.237381783691473,"point":[2.5,2.5]} ,{"index":8,"value":3.22048082090848,"point":[2.5,0]} ,{"index":13,"value":3.5274036595485314,"point":[2.5,3.75]} ,{"index":30,"value":3.8983596258545377,"point":[3.125,1.875]} ,{"index":50,"value":3.898359625854539,"point":[3.125000000000001,1.8750000000000009]} ,{"index":106,"value":4.098052354732046,"point":[3.4374999999999982,3.4375000000000036]} ,{"index":120,"value":4.710792046302386,"point":[3.437499999999993,4.062499999999998]} ,{"index":133,"value":4.710792046302387,"point":[3.437499999999997,4.062499999999997]} ,{"index":187,"value":4.772170844247013,"point":[3.437499999999993,1.71875]} ,{"index":193,"value":4.779243361447049,"point":[3.398437500000016,1.6796874999999813]} ,{"index":197,"value":4.782665402235109,"point":[3.4179687499999636,1.699218750000023]} ]