![]() |
Getting a 'three-way' option in a mission?
Ok, no giggling about the thread title...
I wanted to set up a mission where there is an equal one chance in three for an option or mission orders to occur. I know, for an equal 1 in 4 chance, I: * place 2 sailboats at 50% probability somewhere on the map * then set up the mission triggers so that: * Sailboat 1 exists (and no Sailboat 2 exists) = 1st mission * Sailboat 2 exists (and no Sailboat 1 exists) = 2nd mission * Both Sailboats exist = 3rd mission * No Sailboats exist = 4th Mission ...but for equal 1 in 3 chance of a mission, is it: * place three Sailboats at 50% somewhere on the map * If Sailboat 1 exists (and no Sailboat 3) = Mission 1 * If Sailboat 2 exists (and no Sailboat 3) = Mission 2 * If Sailboat 1 OR 2 exists AND Sailboat 3 exists = Mission 3 Mathematically, does that work out to an equal one chance in three of the mission occurring? Thanks guys - Math isn't my strong suit - so I wanted to ask :03: Stew |
(sailboat); A,B,C... - mission types
(1) = A (2) = B (2)+(3) = C (3)+(1) = C You have also "new kind" of mission for next variants: (3) = D (1)+(2)+(3) = E (1)+(2) = [A,B] = F My proposition: chance of mission A = chance of mission B = chance of mission C (place 3 missions in dynamic group with minimum/maximum =1) and if: A then create (1) B then create (2) C then create (1a)+(3a) or (2b)+(3b) |
Ahh, that makes sense, P7 - thanks for that mate!:Kaleun_Thumbs_Up:
On reflection, where I got it wrong with my model was that if there is NO sailboat 1 or 2 created, then the mission won't work - your way is better! I appreciate your help! Stew |
With my method you can set own % for each mission. For exapmle:
15% for A - then create (1) 25% for B - then create (2) 60% for C - then create (1a)+(3a) or (2b)+(3b) (now is 10% for each mission but one variant must be created - which is highest priority for dynamic group) |
All times are GMT -5. The time now is 04:45 PM. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2025, Jelsoft Enterprises Ltd.
Copyright © 1995- 2025 Subsim®
"Subsim" is a registered trademark, all rights reserved.