1. Installing and starting

Download the setup file and follow the instructions to install. A download link will be sent to your email after purchase.

In the folder you've chosen to install MonkerSolver you will find a file called MonkerSolver.l4j. To give MonkerSolver more memory you will need to:

  • Open MonkerSolver.l4j with a text editor of your choice.
  • Change the -Xmx4g line to a higher value, for example -Xmx8g.
  • Restart MonkerSolver.

Note that giving MonkerSolver more memory than is available on your computer may result in crashes.

If you don't have Java installed you will need to download and install the Java JRE. If you are using Windows, make sure you download the 64-bit version ("Windows x64 offline" from the list).

2. Building the game tree

Start by clicking the "New" button in the Tree tab.

Select Omaha or Hold'em, which street to begin solving on, and the number of players.
Input stack sizes and dead money. In preflop trees, dead money refers to antes. In postflop, it refers to the pot size.

Now when your root node has been created, you can begin adding more actions to the betting tree. Calls, folds and all-ins are added automatically, but may be removed manually. Select one or more actions from the checkboxes and click "Add" to add the actions to the selected game node.

You can also add the selected actions to multiple nodes by right-clicking on a node and selecting "Add to". This will add the selected actions to all subnodes which fit the selected criteria (preflop nodes, postflop nodes or a custom filter).

A special action labeled "AUTO" is available, which when added to a node will morph in to our recommended bet sizing for that node. A very quick way to create a sensible game tree is therefore to:

  • Select the "AUTO" action.
  • Right-click the root node and select "Add to -> Preflop nodes"
  • Right-click the root node and select "Add to -> Postflop nodes"

3. Abstraction settings

Once you have created a game tree you can view the required memory in the setting tab. If the memory exceeds your limitations, you can either go back to the tree tab and trim the tree, or reduce the number of hand buckets. We recommend between 15-30 strength buckets on each street. The abstraction settings and how they will impact the memory cost and solution quality is discussed in more depth here.

4. Solving and viewing the solution

When you are satisfied with the game tree and abstraction settings you can begin solving the tree. Switch to the "Solve"-tab and press the start button. If the tree is postflop you will have to select the board cards before starting.

The time required for the solution to converge will vary heavily on the size of the game tree. Large preflop trees may take several days to converge. An iteration count equal to 10 times the node count is a good guideline for when the solution starts becoming sound. You can however view the solution while it is converging.

Here we are viewing the solution of a preflop HU Hold'em game tree. In this spot the button has called a 3-bet preflop and is now facing a cbet on QdTd8h.

You can analyze ranges further by clicking the column header of an action in the table. You can also view the equity graph in the current spot by clicking the "Equity graph"-button.

The buttons call range in the same spot as above. This view offers FlopZilla-like statistics.

The equity graph. Blue refers to the current player to act, i.e. the button in this spot.

The board overview shows the frequencies in the current spot across every possible board. Here we have sorted on the fold frequency to find the button folds the most often on the AAA board against a 3-bet cbet.