Using Monads in C++ to Solve Constraints: 3. The Tale of Two Monads Posted by Bartosz Milewski under C++, Functional Programming, Programming Leave a Comment This is part 3 of the miniseries about solving a simple constraint-satisfaction problem: s e n d + m o r e --------- m o n e y using monads in C++. Previously: The State Monad A constraint satisfaction problem may be solved by brute force, by
![Using Monads in C++ to Solve Constraints: 3. The Tale of Two Monads](https://cdn-ak-scissors.b.st-hatena.com/image/square/296834ce6c82ab6e41ab9b9ba4d4de2a8b38a2f6/height=288;version=1;width=512/https%3A%2F%2Fbartoszmilewski.com%2Fwp-content%2Fuploads%2F2015%2F05%2Flistselections.png%3Fw%3D300)