aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorTa180m2019-05-14 12:36:35 -0500
committerGitHub2019-05-14 12:36:35 -0500
commit9742357efca6304b2167c66b4c18dc9ace7e1d65 (patch)
tree5dadee08172dcf9c0ca884b86aa800329770c97b /README.md
parent4052f6151004695788f360209964f56f217e9a4d (diff)
Update README.md
Diffstat (limited to 'README.md')
-rw-r--r--README.md2
1 files changed, 2 insertions, 0 deletions
diff --git a/README.md b/README.md
index 2636ebb..3b402bf 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,8 @@
# Gimkit
Ever wondered about what the optimal [Gimkit](https://gimkit.com) strategy is? Well, now you can get a definite answer with `dp_solver.cpp`, which uses a Dynamic Programming algorithm to search for the optimal Gimkit strategy. This algorithm can calculate the optimal strategy from any arbitary starting state.
+See [this link](https://onlinegdb.com/B1dEnuu2E) to run `dp_solver.cpp`.
+
## How to use
```
// Initial conditions