- Decmember 2020 Solution: Uses constraint-based programming to solve the boards found at https://www.janestreet.com/puzzles/twenty-four-seven-2-by-2-2-index/
- April 2021 Solution: Uses an algorithm that combines variable elimination (dynamic progamming) and divide and conquer to solve the probability question found at https://www.janestreet.com/puzzles/bracketology-101-index/
- October 2021 Solution: Uses dynamic programming and combinatorics to solve the probability question found at https://www.janestreet.com/puzzles/robot-swimming-trials-index/ + explanation here
- April 2023 Solution: Uses an early stopping graph search and combinatorics to solve the enumeration problem found at https://www.janestreet.com/puzzles/arc-edge-acreage-index/
- August 2023 Solution: Explanation here https://www.janestreet.com/puzzles/single-cross-2-index/
- April 2024 Solution: Explanation here https://www.janestreet.com/puzzles/robot-capture-the-flag-index/
chands10/PuzzleSolver
Program-based approaches to solving some of the Jane Street puzzles found at https://www.janestreet.com/puzzles/archive/
PythonMIT