battleship-combinatorics: Compute number of possible arrangements in the battleship game

[ bsd3, library, math, program ] [ Propose Tags ]

Compute number of possible arrangements in the battleship game with different methods.

https://en.wikipedia.org/wiki/Battleship_(game)

Versions [RSS] [faq] 0.0, 0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.1 base (>=4.5 && <5), battleship-combinatorics, combinatorial (>=0.0 && <0.2), containers (>=0.4.2 && <0.7), deepseq (>=1.3 && <1.5), directory (>=1.1 && <1.4), filepath (>=1.3 && <1.5), non-empty (>=0.2.1 && <0.4), pooled-io (>=0.0.2 && <0.1), prelude-compat (>=0.0 && <0.0.1), QuickCheck (>=2.5 && <3.0), random (>=1.0 && <1.3), semigroups (>=0.1 && <1.0), set-cover (==0.1.*), storable-record (>=0.0.3 && <0.1), storablevector (>=0.2.11 && <0.3), temporary (>=1.1 && <1.4), transformers (>=0.3 && <0.7), utility-ht (>=0.0.8 && <0.1) [details] BSD-3-Clause Henning Thielemann Henning Thielemann Math https://hub.darcs.net/thielema/battleship-combinatorics/ this: darcs get https://hub.darcs.net/thielema/battleship-combinatorics/ --tag 0.0.1head: darcs get https://hub.darcs.net/thielema/battleship-combinatorics/ by HenningThielemann at 2021-11-18T10:32:48Z NixOS:0.0.0.2, Stackage:0.0.1 battleship-combinatorics 1586 total (92 in the last 30 days) (no votes yet) [estimated by Bayesian average] λ λ λ Docs available Last success reported on 2021-11-18