Riddler - Solutions to Castles Puzzle: castle-solutions.csv
Data license: CC Attribution 4.0 License · Data source: fivethirtyeight/data on GitHub · About: simonw/fivethirtyeight-datasette
1,349 rows sorted by Why did you choose your troop deployment?
This data as json, copyable, CSV (advanced)
Suggested facets: Castle 1, Castle 2, Castle 3
Link | 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? ▼ |
---|---|---|---|---|---|---|---|---|---|---|---|---|
70 | 70 | 11 | 11 | 11 | 11 | 11 | 11 | 11 | 11 | 11 | 1 | |
78 | 78 | 11 | 0 | 0 | 0 | 0 | 0 | 0 | 29 | 29 | 31 | |
88 | 88 | 10 | 10 | 10 | 10 | 10 | 10 | 10 | 10 | 10 | 10 | |
136 | 136 | 6 | 8 | 9 | 16 | 18 | 21 | 22 | 0 | 0 | 0 | |
152 | 152 | 6 | 0 | 0 | 0 | 0 | 0 | 0 | 26 | 27 | 41 | |
180 | 180 | 5 | 5 | 10 | 20 | 20 | 20 | 20 | 0 | 0 | 0 | |
244 | 244 | 4 | 1 | 1 | 16 | 21 | 25 | 29 | 1 | 1 | 1 | |
255 | 255 | 4 | 0 | 0 | 0 | 0 | 0 | 0 | 29 | 32 | 35 | |
286 | 286 | 3 | 5 | 8 | 10 | 13 | 1 | 26 | 30 | 2 | 2 | |
294 | 294 | 3 | 5 | 7 | 9 | 11 | 13 | 15 | 17 | 19 | 1 | |
298 | 298 | 3 | 4 | 5 | 18 | 22 | 20 | 21 | 2 | 3 | 2 | |
305 | 305 | 3 | 3 | 13 | 13 | 3 | 13 | 13 | 18 | 3 | 18 | |
308 | 308 | 3 | 3 | 6 | 7 | 3 | 15 | 10 | 30 | 20 | 3 | |
325 | 325 | 3 | 3 | 3 | 3 | 3 | 11 | 16 | 21 | 34 | 3 | |
329 | 329 | 3 | 2 | 2 | 2 | 1 | 1 | 1 | 31 | 29 | 28 | |
336 | 336 | 3 | 0 | 0 | 0 | 0 | 0 | 0 | 29 | 32 | 36 | |
341 | 341 | 2 | 17 | 5 | 8 | 13 | 21 | 34 | 0 | 0 | 0 | |
344 | 344 | 2 | 12 | 2 | 15 | 2 | 18 | 2 | 21 | 2 | 24 | |
367 | 367 | 2 | 4 | 10 | 10 | 15 | 15 | 20 | 20 | 2 | 2 | |
377 | 377 | 2 | 4 | 6 | 13 | 15 | 18 | 18 | 24 | 0 | 0 | |
389 | 389 | 2 | 4 | 6 | 8 | 10 | 12 | 14 | 16 | 18 | 10 | |
427 | 427 | 2 | 4 | 5 | 7 | 9 | 11 | 13 | 15 | 16 | 18 | |
445 | 445 | 2 | 3 | 5 | 8 | 12 | 17 | 23 | 30 | 0 | 0 | |
454 | 454 | 2 | 3 | 5 | 6 | 7 | 9 | 10 | 30 | 13 | 15 | |
456 | 456 | 2 | 3 | 4 | 5 | 7 | 11 | 20 | 33 | 15 | 0 | |
463 | 463 | 2 | 3 | 3 | 3 | 5 | 5 | 7 | 7 | 15 | 50 | |
477 | 477 | 2 | 2 | 6 | 11 | 16 | 2 | 2 | 26 | 2 | 31 | |
551 | 551 | 2 | 2 | 2 | 2 | 2 | 12 | 21 | 21 | 22 | 14 | |
552 | 552 | 2 | 2 | 2 | 2 | 2 | 11 | 11 | 10 | 38 | 20 | |
573 | 573 | 2 | 1 | 2 | 11 | 16 | 2 | 2 | 2 | 31 | 31 | |
582 | 582 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 31 | 33 | 34 | |
594 | 594 | 1 | 9 | 10 | 10 | 10 | 10 | 20 | 30 | 0 | 0 | |
601 | 601 | 1 | 7 | 8 | 9 | 7 | 4 | 11 | 16 | 21 | 16 | |
628 | 628 | 1 | 4 | 1 | 1 | 1 | 1 | 1 | 30 | 30 | 30 | |
630 | 630 | 1 | 3 | 6 | 10 | 15 | 20 | 25 | 15 | 3 | 2 | |
633 | 633 | 1 | 3 | 5 | 8 | 10 | 13 | 15 | 18 | 15 | 12 | |
654 | 654 | 1 | 3 | 5 | 7 | 9 | 11 | 13 | 15 | 17 | 19 | |
664 | 664 | 1 | 3 | 4 | 6 | 8 | 12 | 14 | 16 | 17 | 19 | |
667 | 667 | 1 | 3 | 3 | 3 | 3 | 15 | 2 | 34 | 34 | 2 | |
677 | 677 | 1 | 2 | 4 | 8 | 2 | 4 | 8 | 16 | 32 | 23 | |
692 | 692 | 1 | 2 | 3 | 4 | 7 | 13 | 17 | 23 | 27 | 3 | |
698 | 698 | 1 | 2 | 2 | 10 | 20 | 21 | 16 | 21 | 5 | 2 | |
704 | 704 | 1 | 2 | 2 | 2 | 20 | 20 | 2 | 25 | 25 | 1 | |
711 | 711 | 1 | 2 | 2 | 2 | 0 | 14 | 16 | 18 | 21 | 24 | |
724 | 724 | 1 | 1 | 11 | 11 | 1 | 11 | 11 | 26 | 1 | 26 | |
733 | 733 | 1 | 1 | 6 | 10 | 20 | 20 | 20 | 20 | 1 | 1 | |
764 | 764 | 1 | 1 | 2 | 2 | 2 | 2 | 30 | 30 | 30 | 0 | |
793 | 793 | 1 | 1 | 1 | 11 | 1 | 1 | 21 | 21 | 21 | 21 | |
796 | 796 | 1 | 1 | 1 | 9 | 11 | 13 | 18 | 20 | 25 | 1 | |
811 | 811 | 1 | 1 | 1 | 3 | 1 | 23 | 23 | 23 | 23 | 1 | |
835 | 835 | 1 | 1 | 1 | 1 | 16 | 25 | 2 | 26 | 26 | 1 | |
847 | 847 | 1 | 1 | 1 | 1 | 11 | 13 | 15 | 17 | 19 | 21 | |
853 | 853 | 1 | 1 | 1 | 1 | 10 | 10 | 20 | 20 | 35 | 1 | |
861 | 861 | 1 | 1 | 1 | 1 | 2 | 4 | 6 | 12 | 24 | 48 | |
868 | 868 | 1 | 1 | 1 | 1 | 1 | 20 | 24 | 25 | 25 | 1 | |
889 | 889 | 1 | 1 | 1 | 1 | 1 | 7 | 14 | 19 | 25 | 30 | |
901 | 901 | 1 | 1 | 1 | 1 | 1 | 1 | 14 | 20 | 20 | 40 | |
922 | 922 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 33 | 33 | 33 | |
936 | 936 | 0 | 12 | 0 | 0 | 18 | 20 | 22 | 28 | 0 | 0 | |
941 | 941 | 0 | 11 | 0 | 0 | 16 | 17 | 27 | 29 | 0 | 0 | |
961 | 961 | 0 | 8 | 0 | 0 | 18 | 20 | 22 | 32 | 0 | 0 | |
971 | 971 | 0 | 7 | 0 | 0 | 16 | 16 | 26 | 31 | 2 | 2 | |
983 | 983 | 0 | 5 | 0 | 15 | 20 | 20 | 20 | 20 | 0 | 0 | |
996 | 996 | 0 | 3 | 6 | 11 | 14 | 17 | 18 | 19 | 11 | 1 | |
1004 | 1004 | 0 | 3 | 3 | 3 | 3 | 20 | 20 | 20 | 25 | 3 | |
1011 | 1011 | 0 | 2 | 2 | 11 | 20 | 2 | 2 | 2 | 28 | 31 | |
1024 | 1024 | 0 | 1 | 5 | 5 | 5 | 0 | 21 | 21 | 21 | 21 | |
1041 | 1041 | 0 | 1 | 1 | 17 | 1 | 1 | 25 | 26 | 26 | 2 | |
1045 | 1045 | 0 | 1 | 1 | 10 | 11 | 16 | 24 | 34 | 1 | 2 | |
1056 | 1056 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 15 | 38 | 41 | |
1109 | 1109 | 0 | 0 | 6 | 8 | 9 | 10 | 13 | 15 | 18 | 21 | |
1116 | 1116 | 0 | 0 | 5 | 10 | 10 | 5 | 10 | 15 | 20 | 25 | |
1129 | 1129 | 0 | 0 | 2 | 3 | 5 | 8 | 12 | 17 | 23 | 30 | |
1136 | 1136 | 0 | 0 | 1 | 2 | 3 | 6 | 13 | 25 | 50 | 0 | |
1235 | 1235 | 0 | 0 | 0 | 2 | 2 | 22 | 23 | 24 | 25 | 2 | |
1252 | 1252 | 0 | 0 | 0 | 0 | 21 | 21 | 0 | 26 | 31 | 1 | |
1256 | 1256 | 0 | 0 | 0 | 0 | 20 | 20 | 20 | 20 | 20 | 0 | |
1274 | 1274 | 0 | 0 | 0 | 0 | 15 | 20 | 0 | 30 | 35 | 0 | |
1285 | 1285 | 0 | 0 | 0 | 0 | 11 | 11 | 21 | 26 | 31 | 0 | |
1305 | 1305 | 0 | 0 | 0 | 0 | 0 | 25 | 25 | 25 | 25 | 0 | |
1316 | 1316 | 0 | 0 | 0 | 0 | 0 | 20 | 20 | 20 | 20 | 20 | |
1324 | 1324 | 0 | 0 | 0 | 0 | 0 | 15 | 15 | 20 | 22 | 28 | |
674 | 674 | 1 | 2 | 5 | 9 | 14 | 19 | 21 | 17 | 12 | 0 | No idea why, but I have a good feeling about using a Poisson distribution with lambda = 1/e*10, solving the pdf for 0:9, and flipping the array, such that pdf(0)= proportion of troops at castle 10, etc. I then assumed I would never win # 10 with only 3 soldiers, so I added them to castle 9. |
312 | 312 | 3 | 3 | 4 | 4 | 4 | 4 | 4 | 35 | 4 | 35 | |
1229 | 1229 | 0 | 0 | 0 | 5 | 0 | 0 | 15 | 0 | 50 | 30 | Œ¿\_(Ü€‹)_/Œ¿ |
326 | 326 | 3 | 3 | 3 | 3 | 3 | 3 | 3 | 3 | 3 | 73 | "Clearly, I could not choose the wine in front of you." Many semi-optimal subsets use proportional allocations of troops. A configuration which slams troops into a single castle and sends 1 to the others beats many of those. 3 troops to almost all castles beats that variant and its 2 troop "brother" strategy. |
760 | 760 | 1 | 1 | 2 | 2 | 16 | 20 | 1 | 26 | 30 | 1 | "What is of supreme importance in war is to attack the enemy's strategy" -Sun Tzu: The Art of War I chose to focus on trying to get outright victories in 5, 6, 8 and 9, since winning those Castles would give 28 points, assuring me of head to head victory no matter what happens with the other castles. I also took a small portion of my troops (8 troops) and allocated them semi-randomly to the other castles, in an attempt to set myself apart from (and hopefully above) anyone who would try a similar 5,6,8, and 9 strategy variant. |
766 | 766 | 1 | 1 | 1 | 30 | 1 | 1 | 1 | 62 | 1 | 1 | (1+2+3...10) = 55, therefore need to win 28 value of castles to win overall. Minimal number of castle is 4 (10,9,8,1) or (9,8,7,4) so assuming many people will pick one of those it might be possible to pick up 2,3,5,6 for 16 points with only 1 point per castle. This leaves 12 points left, which make for 4 & 8 required. People probably weight towards the high values, so splitting them 2:1 the same as the points weighting seems sensible. After further consideration of the split for ties decided to reduce each primary force by 1 to take full possession of any castle ignored by my opponent. Giving me 8 x 1 and one 62 and one 30 and to hope that I've guess what other people will try correctly. |
1104 | 1104 | 0 | 0 | 6 | 16 | 21 | 26 | 31 | 0 | 0 | 0 | (10+9+8) < (7+6+5+4+3+2+1), so the top three castles are negligible if I can win the bottom seven castles. Since winning the 6th castle once is the same as winning all three of the 1st, 2nd, and 3rd castles, it makes the most sense to load up troops in the middle four castles. Also assuming people naturally group numbers into multiples of five, I used a distribution of (multiples of 5)+1. |
1022 | 1022 | 0 | 1 | 6 | 8 | 10 | 11 | 13 | 15 | 17 | 19 | (100. / sum(np.arange(11)))*np.array(np.arange(11)) Then rounded up. |
546 | 546 | 2 | 2 | 2 | 2 | 2 | 22 | 22 | 22 | 22 | 2 | (i may have mis-typed the first entry... stupid mobile phone. sorry!) |
328 | 328 | 3 | 2 | 2 | 2 | 2 | 2 | 2 | 28 | 29 | 28 | * Compete in the three most valuable castles, worth 27 points in total, and hope to win at least one more victory point by forfeit. * Counter similar strategies by not going all-in on the top three, hedge by covering the remaining 28 points worth of castles with at least 2 soldiers. |
1207 | 1207 | 0 | 0 | 0 | 10 | 15 | 20 | 25 | 30 | 0 | 0 | *There are 55 total points, so we are trying to figure out the path to 28. How can we do this in the smartest way? *Let's think about where we can concede points and hopefully make our archenemy overpay. *In strategy games like this, the extremes tend to draw the majority of the attention, so we will immediately concede 1, 2, 3, 9 and 10. *This leaves me with 100 soldiers to allocate towards 4-8. *Assuming the archenemy has some sort of distribution weighted towards the more valuable castles (unfortunate we do not know anything more about their mindset!), we will need to allocate more soldiers towards 8 than 7 and more towards 7 than 6, etc. *Side note* I could have cheated a bit here, because the question at the end says "Whoever wins the most wars wins the battle royale and is crowned king or queen of Riddler Nation!" so logically I could just aim for winning Castles 1-6 assuming each of those is a "war" and disregarded the "point system" =) |
442 | 442 | 2 | 3 | 6 | 11 | 16 | 26 | 33 | 1 | 1 | 1 | -Worth leaving 1 point at every castle, in case opponent leaves 0 -People will waste troops on high point castles -Many people will use round numbers (10, 15, 20), so putting 1 extra point will mean a few free victories. -The goal isn't to beat the *best* players, but to beat the *most*, and this strat should be decent against a lot of comps |
801 | 801 | 1 | 1 | 1 | 7 | 10 | 12 | 14 | 16 | 18 | 20 | 1 more than evenly dividing troops by points would suggest for 6 to 10. Same number as even division for 4 and 5. 1 troop each for 1, 2, 3. |
227 | 227 | 4 | 7 | 9 | 12 | 14 | 16 | 18 | 20 | 0 | 0 | 1-8 majority of points |
987 | 987 | 0 | 5 | 0 | 0 | 16 | 21 | 25 | 29 | 2 | 2 | 100 soldiers/28 points to win = 3.6 soldiers per point if none are wasted. so I focused on 8,7,6,5, and 2 castles for close to that 3.6x ratio. The goal is to win 28 and only 28 points by keying on the marginal value of an additional soldier. The one luxury is that I've allotted for 2 soldiers in castles 9 and 10 to catch others trying to slack off with 0 or 1 there. |
852 | 852 | 1 | 1 | 1 | 1 | 10 | 20 | 20 | 20 | 15 | 11 | 11 on 10 to beat anyone who went 10 across the board. Less on 9 than 8 incase someone heavily tries to win the last two - can't compete - need to spread a bit. 6,7,8 with 20 is a decently powerful base to take which is likely to get at least one or two of them. 10 on 5 as it's worth something, then 1 to all the others - I mean it's at least worth trying - they total 10 together so I'd rather stock up on the higher ones. |
1342 | 1342 | 0 | 0 | 0 | 0 | 0 | 0 | 10 | 20 | 30 | 40 | 1st 6 castles are worth an average of 2 2/3 points. The last 4 are worth an average of 8 1/2 points. Any 2 of the last 4 gets more than the first 6 combined. |
550 | 550 | 2 | 2 | 2 | 2 | 2 | 14 | 16 | 18 | 20 | 22 | 2 men to defeat everyone who just sent 1. then hope to get lucky with the larger ones. |
Advanced export
JSON shape: default, array, newline-delimited
CREATE TABLE "riddler-castles/castle-solutions" ( "Castle 1" INTEGER, "Castle 2" INTEGER, "Castle 3" INTEGER, "Castle 4" INTEGER, "Castle 5" INTEGER, "Castle 6" INTEGER, "Castle 7" INTEGER, "Castle 8" INTEGER, "Castle 9" INTEGER, "Castle 10" INTEGER, "Why did you choose your troop deployment?" TEXT );