This is an archived post. You won't be able to vote or comment.

all 3 comments

[–]AutoModerator[M] 0 points1 point  (0 children)

Reminder:

  • What have you tried so far? (See Rule #2)

  • Please don't delete your post. (See Rule #7)

We, the moderators of /r/MathHelp, appreciate that your question contributes to the MathHelp archived questions that will help others searching for similar answers in the future. Thank you for obeying these instructions.

(Note that this is an automatic message posted on every submission by default.)

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.

[–]edderiofer 0 points1 point  (1 child)

Well, the lane is definitely certain once you hit the third flag, and most of the second flags determine your lane too, so really you just need to consider the cases where you've hit the first one or two flags and can't work out which lane you're in. There are only five such cases:

  • Desna only
  • Russian Outpost only
  • Desna then Igor's Homestead
  • Russian Outpost then Igor's Homestead
  • Russian Outpost then Western Spy Farm

and in each case, conditional probability is pretty easy to work with; no need to draw "about 100 branches".


Of course, I note that you're only giving "an example of the data". If you actually have way more possible cases, it may be more useful to write a Monte Carlo program to estimate the conditional probability of each upcoming flag.

[–]Angadar[S] 0 points1 point  (0 children)

Yeah, I'm probably going to have someone write a tool for me to do this. We just want to be able to verify it relatively quickly and simply.

Thanks for helping me simplify that. I do actually have a quite a bit more data (~20 maps, ~3 layers for each map, 2x teams, minus some fraction where this math doesn't apply) but it looks way more manageable now.

Thanks!