LHS with sudoku constraint
Project description
Latin hypercube sampler with a sudoku-like constraint.
The sudoku LHS algorithm is a bit like the first stage in the design of an N-dimensional sudoku puzzle, hence the name: each “sudoku box” must have exactly the same number of samples, and no two samples may occur on the same axis-aligned hyperplane.
This gives coarse stratification in N dimensions with linear runtime.
Supports Python 2.7 and 3.4.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
sudoku_lhs-0.1.0.tar.gz
(13.1 kB
view hashes)
Built Distribution
Close
Hashes for sudoku_lhs-0.1.0-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | da95ecb669d9752868d700b79337b9481d81882674a6dd7dc00e71fa5ad0ae0f |
|
MD5 | c246801120e79de72ce89758515878a2 |
|
BLAKE2b-256 | 2ba24f7f20d8df949b2ebdfc972253a1a756d0439c26df976bf0b59b15ca79f6 |