spaceprobe: Optimization over arbitrary search spaces

[ bsd3, library, optimization ] [ Propose Tags ]

A parameter optimization library, designed for optimizing over arbitrary search spaces. It is particularly well suited for discontinuous and/or high-dimensional search spaces.

[Skip to Readme]
Versions [faq] 0.0.0, 0.1.0, 0.2.0, 0.3.0
Dependencies base (>=2 && <5), clock (>=, containers, erf (>=, mtl (>= [details]
License BSD-3-Clause
Author Sean Burton <>
Maintainer Sean Burton <>
Category Optimization
Home page
Bug tracker
Source repo head: git clone
Uploaded by SeanBurton at Wed May 27 09:46:30 UTC 2015
Distributions NixOS:0.3.0
Downloads 1271 total (45 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2015-05-28 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees

Readme for spaceprobe-0.3.0

[back to package description]

This is spaceprobe!

Spaceprobe is an applicative combinator library for parameter optimization based on Monte-Carlo Tree Search with several enhancements. It is designed to be easy to use, and to work robustly on discontinuous and/or high-dimensional search spaces.


I'm more than happy to recieve bug reports, fixes, improved documentation, feature enhancements, and other improvements.

Please report bugs using the github issue tracker.


This library is written and maintained by Sean Burton. You can contact me at