a/Gimkit
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

Update README.md

Browse source 
Formatting
This commit is contained in:
Ta180m 2019-05-07 13:15:14 -05:00 committed by GitHub
parent 59f845844a
commit 21ddf42a39
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
README.md
View file

@ -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