aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorTa180m2019-05-07 13:15:14 -0500
committerGitHub2019-05-07 13:15:14 -0500
commit21ddf42a39527aa7cb6587f0709759cfde23596b (patch)
treecd5357bcf3d15085e75e253aeb895c345023b519 /README.md
parent59f845844a4c94a8f13d89f7f7e297ca23f710ec (diff)
Update README.md
Formatting
Diffstat (limited to 'README.md')
-rw-r--r--README.md6
1 files changed, 4 insertions, 2 deletions
diff --git a/README.md b/README.md
index b7d190d..fa88d74 100644
--- a/README.md
+++ b/README.md
@@ -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