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.
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.1.tar.gz
(13.3 kB
view hashes)
Built Distribution
Close
Hashes for sudoku_lhs-0.1.1-py2.py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 1bd57af7718540e5afc0119d115e3832880a3c38621fa46f230aa92435e7e40d |
|
| MD5 | 6e74a72afae9d5b7e0120f3b65f38854 |
|
| BLAKE2b-256 | 47e1658703120433e9e1691536ec72358c2aaf6d58765f50eb1015f6b96853c3 |
