Monte Hall problem

Simulates the Monte Hall problem using Clojure.

Inspired by a stranger who also wrote a program to understand this.

Installation

1. Clone or download this repository.
2. Install Leiningen (if you haven't already)

Usage

Run using Leiningen

lein run

Example

$ lein run
Keep same door
10000 trials: won 3359, lost 6641 (0.3359)
Change door
10000 trials: won 6628, lost 3372 (0.6628)
Random door
10000 trials: won 4986, lost 5014 (0.4986)

License

Copyright © 2018 Corey Beres

Distributed under the GNU General Public License either version 3.0 or (at your option) any later version.