riddler-castles/castle-solutions-2: 493
Data source: https://github.com/fivethirtyeight/data/blob/master/riddler-castles/castle-solutions-2.csv
rowid | Castle 1 | Castle 2 | Castle 3 | Castle 4 | Castle 5 | Castle 6 | Castle 7 | Castle 8 | Castle 9 | Castle 10 | Why did you choose your troop deployment? |
---|---|---|---|---|---|---|---|---|---|---|---|
493 | 0 | 5 | 7 | 9 | 12 | 1 | 26 | 31 | 5 | 4 | Use simulated annealing to try to find the optimal deployment given the list of deployments from the last competition. Then append that deployment to the list (simulating someone who did the same thing that I did) and repeat for a while. This assumes that people will take the last battle's results into account. (Simulated annealing: take a deployment, make a random switch, and test the results against all other deployments. If it's better, continue from the new deployment. Occasionally continue from the new deployment if it's worse Š—– don't want to get stuck in local minima. ) I also made sure it beats last time's winner, in case many people play that. This is not the optimal deployment for the last battle's results (> 91% is possible, though it still would have won) but it's the best one I found that has good performance for both the original list and the list containing good players. |