Standalone Pattern Set 3.s.2 in Connect 4
Connect 4 in 3 Moves
Deduction Path: Disc Omission on Pattern and on Depth of the Other Pattern.
Number of Patterns: 2
Pattern List: re1ppp, re0re0pp
Deduced From: re0ppp, re0ppp
Winning Move: re1 of re1ppp and re0 of re0re0pp different from re1 of re1ppp (from identical pset 3.s.4)
After playing this winning move the pattern set specified under deduced from pattern sets hereunder is created by following (in reverse direction) the deduction path above.
Deduced From Pattern Sets:
Pset 2.s.1 (re0ppp, re0ppp, Deduction Path: Empty Siding Fork)
Deduction Source for Pattern Sets:
Pset 4.s.4 (re0ppp, re1ppp, re0re0pp, Deduction Path: Empty Siding Fork)
Pset 4.s.5 (re0ppp, re2ppp, re1re0pp, Deduction Path: Empty Sharing Fork Sub-Top with Topping of Shared Re)
Pset 4.s.6 (re0ppp, re1ppp, re1re0pp, Deduction Path: Empty Sharing Fork Sub-Top with Topping of One Unshared Defensible Re)
Pset 4.s.7 (re1ppp, re1ppp, re0re0pp, Deduction Path: Empty Sharing Fork Top-Sub with Topping of One Unshared Defensible Re)
Pset 4.s.15 (re1ppp, re0re0pp, re0re0pp, re0re0pp, Deduction Path: Empty Siding Fork with All Defensible Re's Different)
Pset 4.s.16 (re1ppp, re1ppp, re0re0pp, re0re0pp, Deduction Path: Empty Siding Fork with All Defensible Re's Different)
Pset 4.s.16 (re1ppp, re1ppp, re0re0pp, re0re0pp, Deduction Path: Empty Siding Fork with All Defensible Re's Different)
Pset 4.s.17 (re1ppp, re0re0pp, re0re0pp, Deduction Path: Empty Siding Fork with Two Defensible Re's Different and Re1ppp Shared)
Pset 4.s.17 (re1ppp, re0re0pp, re0re0pp, Deduction Path: Empty Siding Fork with Two Defensible Re's Different and Re1ppp Shared)
Pset 4.s.21 (re1ppp, re0re0pp, re0re0pp, re1re0pp, Deduction Path: Empty Siding Fork with All Defensible Re's Different)
Pset 4.s.22 (re1ppp, re0re0pp, re0re0pp, re1re0pp, Deduction Path: Empty Siding Fork with All Defensible Re's Different)
Condition List:
- 12EmptyOneEqual: The rotatable empty (re) position of the first redppp pattern of the concerned pset is on the same column as a re of the second red1red2pp pattern. In other words the two patterns of the concerned pset have one pair re's sharing the same column. The other re of the second pattern is on a different column.
- AfterMoveNoFasterWinForOpponent: After the players winning move, as specified by the winning move property above, no pattern set (pset) of the opponent may exist on the board that implies a faster win for the opponent. If the player can choose more than one column to win, it is sufficient no faster opponent win exists after the players move on one of those winning columns. For example for psets 3.x.y (connects 4 in 3 moves) no psets 1.v.w (connects 4 in 1 move) of the opponent may exist after the specified players move.
This pattern sets video:
https://rumble.com/v6f1vrg-standalone-pset-3.s.2-in-connect-4-in-3-moves-pattern-recognition-deduction.html
Connect 4 Board Example List:
PESSPSPEEEPSSSEEESEPSEEEPEPPEEEPEEEEEEEEEEE
PPSPSSPPSESPSSEPEPPSPEEEEEPSEEEEEESEEEEEEEE
PPSSEPPEPPPESEESSEEEEEESEEEEEEEEEEEEEEEEEEE
PPSSEPPEPPPESSESSPEPPEESEESSEESEEEEEEPEEEEE
PSPPSPSSPSSEPPEPPPESEESSEEEEEEEEEEEEEEEEEEE
PSPSSPSSPSPSSSPPESSPPPPEPPSPESESEPSESEEESPE
PSSSPSPEPPPSSSEEESEPSEEEPEPPEEEPESEEEEEEEEE |
|
|
|