aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTa180m2019-05-17 13:12:09 -0500
committerGitHub2019-05-17 13:12:09 -0500
commit6e948eca192428ad0fc1440ce84bcedf8a63c4ce (patch)
tree8322679e0d6e5ef5411194cee089a3c4ea1df8f3
parent7ac022b23cb836a21f8cc345ff8533f4b98bcfbc (diff)
Update README.md
-rw-r--r--README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/README.md b/README.md
index 3b402bf..94847f8 100644
--- a/README.md
+++ b/README.md
@@ -1,7 +1,7 @@
# 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`.
+See [this link](https://onlinegdb.com/rJNOKO324) to run `dp_solver.cpp`.
## How to use
```