Mixup:Lidia-122-simple.gbt: Difference between revisions

From Wavu Wiki, the 🌊 wavy Tekken wiki
No edit summary
No edit summary
Line 22: Line 22:
Note that d+1 and uf+4 beat CFT.4. Against many chars CFT.4 evades these options.
Note that d+1 and uf+4 beat CFT.4. Against many chars CFT.4 evades these options.


Note that CFT.2,3 beats all steps. Against many chars it loses to ssr."
Assuming that CFT.2,3 beats all steps, but note that this isn't always the case."


{
{

Revision as of 09:14, 8 March 2022

<?xml version="1.0" encoding="UTF-8"?>
<gambit:document xmlns:gambit="http://gambit.sourceforge.net/" version="0.1">
<colors>
<player id="-1" red="0" green="0" blue="0" />
<player id="0" red="154" green="205" blue="50" />
<player id="1" red="255" green="0" blue="0" />
<player id="2" red="0" green="0" blue="255" />
</colors>
<font size="10" family="74" face="Arial" style="90" weight="92" />
<numbers decimals="4"/>
<game>
<nfgfile>
NFG 1 R "Lidia 1,2,2 on hit" { "Attacker" "Defender" }

{ { "CFT.1" "CFT.2,3" "CFT.3" "CFT.4" "CFT.1+2" "TAW.1" "TAW.2" "TAW.3,1" "TAW.4" }
{ "b" "d" "b,d" "d,b" "db+1" "uf+4" "3:2" "ssr,b" "ssr,d" "swr" "swl" }
}
"Lidia 1,2,2 on hit in mirror on infinite stage.

Assumes {{P2}} doesn't parry and doesn't react to second stance but rather commits to a particular strategy from start.

Note that d+1 and uf+4 beat CFT.4. Against many chars CFT.4 evades these options.

Assuming that CFT.2,3 beats all steps, but note that this isn't always the case."

{
{ "" -1, 1 }
{ "" 0, 0 }
{ "" 33, -33 }
{ "" 3, -3 }
{ "" -80, 80 }
{ "" -8, 8 }
{ "" 28, -28 }
{ "" 61, -61 }
{ "" -60, 60 }
{ "" -60, 60 }
{ "" -30, 30 }
{ "" -8, 8 }
{ "" 38, -38 }
{ "" 38, -38 }
{ "" 35, -35 }
{ "" 35, -35 }
{ "" 35, -35 }
{ "" -1, 1 }
{ "" -60, 60 }
{ "" -7, 7 }
{ "" 75, -75 }
{ "" 75, -75 }
{ "" 28, -28 }
{ "" 28, -28 }
{ "" 28, -28 }
{ "" 32, -32 }
{ "" -8, 8 }
{ "" -67, 67 }
{ "" 34, -34 }
{ "" 32, -32 }
{ "" 32, -32 }
{ "" 32, -32 }
{ "" -29, 29 }
{ "" 31, -31 }
{ "" 59, -59 }
{ "" 27, -27 }
{ "" 59, -59 }
{ "" -60, 60 }
{ "" -60, 60 }
{ "" -20, 20 }
{ "" 2, -2 }
{ "" 51, -51 }
{ "" -7, 7 }
{ "" -69, 69 }
{ "" -85, 85 }
{ "" 2, -2 }
{ "" 51, -51 }
{ "" -60, 60 }
{ "" 28, -28 }
{ "" -60, 60 }
{ "" -40, 40 }
{ "" -1, 1 }
{ "" 28, -28 }
{ "" -7, 7 }
{ "" -69, 69 }
{ "" -85, 85 }
{ "" -1, 1 }
{ "" 28, -28 }
{ "" -60, 60 }
{ "" -40, 40 }
{ "" -60, 60 }
{ "" -60, 60 }
{ "" 31, -31 }
{ "" 32, -32 }
{ "" 28, -28 }
{ "" 35, -35 }
{ "" -40, 40 }
{ "" -1, 1 }
{ "" 42, -42 }
{ "" -7, 7 }
{ "" -69, 69 }
{ "" -85, 85 }
{ "" -1, 1 }
{ "" 42, -42 }
{ "" 30, -30 }
{ "" -40, 40 }
{ "" -7, 7 }
{ "" -69, 69 }
{ "" -85, 85 }
{ "" 30, -30 }
{ "" -40, 40 }
{ "" -1, 1 }
{ "" 33, -33 }
{ "" 3, -3 }
{ "" -1, 1 }
{ "" -60, 60 }
{ "" 32, -32 }
{ "" -80, 80 }
{ "" -29, 29 }
{ "" 31, -31 }
{ "" 51, -51 }
{ "" 2, -2 }
{ "" 28, -28 }
{ "" -1, 1 }
{ "" 42, -42 }
{ "" -1, 1 }
{ "" -40, 40 }
{ "" 30, -30 }
}
1 2 18 26 33 41 52 68 75 3 4 19 5 34 42 53 69 76 82 0 85 87 89 91 93 95 97 83 84 86 88 90 92 94 96 98 6 12 20 27 35 43 54 70 77 7 13 21 28 36 44 55 71 78 8 14 22 29 37 45 56 72 79 9 15 23 30 38 46 57 73 80 10 16 24 31 39 47 58 74 81 11 17 25 32 40 48 49 51 50 67 66 65 64 63 59 61 60 62 
</nfgfile>
<analysis type="list">
<description>
One equilibrium by solving a linear program in strategic game
</description>
<profile type="mixed">
24134210371/157140168637,61261872930/157140168637,0,21414066922/157140168637,23233778731/157140168637,90945635870/1099981180459,3542029980/157140168637,0,73933832051/1099981180459,82945735508/157140168637,25523197203/157140168637,49340557/157140168637,0,34098203396/157140168637,4841627356/157140168637,0,165012212/157140168637,0,9517052405/157140168637,0
</profile>
</analysis>
</game>
</gambit:document>