diff options
author | Ta180m | 2019-05-07 13:15:14 -0500 |
---|---|---|
committer | GitHub | 2019-05-07 13:15:14 -0500 |
commit | 21ddf42a39527aa7cb6587f0709759cfde23596b (patch) | |
tree | cd5357bcf3d15085e75e253aeb895c345023b519 /README.md | |
parent | 59f845844a4c94a8f13d89f7f7e297ca23f710ec (diff) |
Update README.md
Formatting
Diffstat (limited to 'README.md')
-rw-r--r-- | README.md | 6 |
1 files changed, 4 insertions, 2 deletions
@@ -2,12 +2,14 @@ Using a Dynamic Programming algorithm to search for the optimal Gimkit strategy. ## How to use -`// Initial conditions +``` +// Initial conditions // Change these values to alter the initial state ll start = 0, goal = 1e10; int max_it = 150; // Number of iterations to solve int MPQ = 0, SB = 0, M = 0; // Initial upgrade status -int D = 0, R = 0, B1 = 0, B2 = 0; // Initial power-up status` +int D = 0, R = 0, B1 = 0, B2 = 0; // Initial power-up status +``` Change these values to alter the initial state: * **start** - Starting amount of money |