__                     __                   
       |__|.-----.-----.-----.|  |.--.--.-----.----.
       |  ||  -__|__ --|  _  ||  ||  |  |  -__|   _|
       |  ||_____|_____|_____||__| \___/|_____|__|   BETA
      Jesolver is a Universal Poker Interface (UPI) poker solving engine that can be used as an alternative to 
      the solver included in PioSOLVER. Its main advantages are faster speed and lower memory usage due to the 
      use of compression. Jesolver is based on the newest iteration of the techniques [1] I developed and used 
      (together with ualberta) to essentially solve HU Limit Hold'em [2].

      Below are some benchmark graphs comparing Jesolver vs. PioSOLVER edge v1.6 on an Intel 4770k CPU 
      overclocked to 4.3GHz. I can run more benchmarks on request.
      First a speed comparison (PioSOLVER vs. Jesolver with different compression levels). Note that, by default, 
      Jesolver automatically chooses the best compression level based on available free memory so you don't usually 
      have to worry about it.

      UPDATE: The charts below are from 2015 and both solvers have since become a lot faster. See 2020 benchmarks.
              Some relatively recent (Apr 2019) Amazon EC2 benchmarks.
              New PioViewer screencap gif mp4 (EC2 c5.24xlarge, 48 cores).
              if you don't buy jesolver you are a weather change denialist
      Memory usage comparison in a bigger game.
      Some other examples (time to solve to 0.05% of the pot):
      Script        PioSOLVER   Jesolver    Difference
      3betpotFAST   07:03       00:32       13.1x
      COsmall       32:47       03:48       8.6x
      CAP2sizes     40:52       10:02       4.1x
      New versions of Jesolver also optimize file sizes. An example (CAP3sizes.txt "small save" (no rivers)):
      PioSOLVER 1.8           156 MB
      Jesolver 1019           129 MB
      Jesolver 1020+          26 MB
      Jesolver 1020+ w/o EVs  8 MB (EVs show as zero in PioViewer, useful if you are only interested in strategies and ranges)
      You can download the latest beta build (1083) of the free version here. The free version includes 
      full turn and river solvers and a demo version of the flop solver that is limited to solving just 
      one flop (Qs Jh 2h, which also happens to be used in many of the demo scripts). Saving (dump_tree)
      is also disabled. 
      Installation: extract the files to any folder (PioSOLVER folder is ok) and switch to the Jesolver 
      executable in PioViewer.
      The current build implements ~95% of PioSOLVER v1.8 functionality. The new preflop functions are not 
      there yet. ICM is not supported but might be added later. If you get errors when browsing 
      small saves, enable 'hide line frequency info' in PioViewer configuration.

      System requirements:
       - Intel Sandy Bridge, AMD Bulldozer (both released in 2011) or newer CPU
       - 4GB+ RAM
       - Windows 7+ (64-bit) or Linux
       - Internet connection for activation (non-free versions)
       - PioViewer basic/pro/edge v1.6+ or another program that supports UPI-engines
       - Like PioSOLVER, Jesolver cannot be used while a blocked poker site (currently Full Tilt Poker, 
         PokerStars) is running.

      Command Reference <-NEW
      How to run Jesolver on a server

      The full version single user, single computer license costs 499 USD and during the beta period 
      you can order it directly from me by mailing to support@jesolver.com. Additional licenses for the
      same user cost 399 USD. Note that I currently only accept payments in bitcoin. Please try the free
      version before buying to make sure it works as expected (no refunds).
      Feel free to mail me if you have any questions.
      [1] Solving Heads-up Limit Texas Hold'em
      Oskari Tammelin, Neil Burch, Michael Johanson, and Michael Bowling
      In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), 2015.

      [2] Heads-Up Limit Hold'em Poker Is Solved
      Michael Bowling, Neil Burch, Michael Johanson, and Oskari Tammelin
      In Science, 347(6218), 145--149, January 2015. 
      Extended version with results: Communications of the ACM, Vol. 60 No. 11, Pages 81-88