@@ -577,74 +577,6 @@ def create_selten_horse_game_efg() -> gbt.Game:
577577 return read_from_file ("e01.efg" )
578578
579579
580- def create_reduction_generic_payoffs_efg () -> gbt .Game :
581- # tree with only root
582- g = gbt .Game .new_tree (
583- players = ["1" , "2" ], title = "2 player reduction generic payoffs"
584- )
585-
586- # add four children
587- g .append_move (g .root , "2" , ["a" , "b" , "c" , "d" ])
588-
589- # add L and R after a
590- g .append_move (g .root .children [0 ], "1" , ["L" , "R" ])
591-
592- # add C and D to single infoset after b and c
593- nodes = [g .root .children [1 ], g .root .children [2 ]]
594- g .append_move (nodes , "1" , ["C" , "D" ])
595-
596- # add s and t from single infoset after rightmost C and D
597- g .append_move (g .root .children [2 ].children , "2" , ["s" , "t" ])
598-
599- # add p and q
600- g .append_move (g .root .children [0 ].children [1 ], "2" , ["p" , "q" ])
601-
602- # add U and V in a single infoset after p and q
603- g .append_move (g .root .children [0 ].children [1 ].children , "1" , ["U" , "V" ])
604-
605- # Set outcomes
606-
607- g .set_outcome (g .root .children [0 ].children [0 ], g .add_outcome ([1 , - 1 ], label = "aL" ))
608- g .set_outcome (
609- g .root .children [0 ].children [1 ].children [0 ].children [0 ],
610- g .add_outcome ([2 , - 2 ], label = "aRpU" ),
611- )
612- g .set_outcome (
613- g .root .children [0 ].children [1 ].children [0 ].children [1 ],
614- g .add_outcome ([3 , - 3 ], label = "aRpV" ),
615- )
616- g .set_outcome (
617- g .root .children [0 ].children [1 ].children [1 ].children [0 ],
618- g .add_outcome ([4 , - 4 ], label = "aRqU" ),
619- )
620- g .set_outcome (
621- g .root .children [0 ].children [1 ].children [1 ].children [1 ],
622- g .add_outcome ([5 , - 5 ], label = "aRqV" ),
623- )
624-
625- g .set_outcome (g .root .children [1 ].children [0 ], g .add_outcome ([6 , - 6 ], label = "bC" ))
626- g .set_outcome (g .root .children [1 ].children [1 ], g .add_outcome ([7 , - 7 ], label = "bD" ))
627-
628- g .set_outcome (
629- g .root .children [2 ].children [0 ].children [0 ], g .add_outcome ([8 , - 8 ], label = "cCs" )
630- )
631- g .set_outcome (
632- g .root .children [2 ].children [0 ].children [1 ], g .add_outcome ([9 , - 9 ], label = "cCt" )
633- )
634- g .set_outcome (
635- g .root .children [2 ].children [1 ].children [0 ],
636- g .add_outcome ([10 , - 10 ], label = "cDs" ),
637- )
638- g .set_outcome (
639- g .root .children [2 ].children [1 ].children [1 ],
640- g .add_outcome ([11 , - 11 ], label = "cDt" ),
641- )
642-
643- g .set_outcome (g .root .children [3 ], g .add_outcome ([12 , - 12 ], label = "d" ))
644- g .to_efg ("reduction_generic_payoffs.efg" )
645- return g
646-
647-
648580def create_reduction_both_players_payoff_ties_efg () -> gbt .Game :
649581 g = gbt .Game .new_tree (players = ["1" , "2" ], title = "From GTE survey" )
650582 g .append_move (g .root , "1" , ["A" , "B" , "C" , "D" ])
0 commit comments