Standalone Pattern Set 4.s.7 in Connect 4
Connect 4 in 4 Moves
Deduction Path: Empty Sharing Fork Top-Sub with Topping of One Unshared Defensible Re.
Top-Sub indicates the first forked pset, as mentioned under deduced from pattern sets, is the top pset and the sub pset is the second forked pset. The concerned re of the sub forked pset is just under the concerned re of the top forked pset as they share the same column. The depth of the sub re remains unchanged. The depth of the top re increments with one. For example re0 increments to re1. The topping clause indicates which re of the sub pset is concerned and thus incremented.
Defensible re is the re of the concerned pset the opponent could defend upon at least if it were the opponents move. Just suppose the opponent is going to move on the concerned pset. If he moves on the defensible re he effectively destroys the players pset without transforming the pset to an even faster win for the player.
Number of Patterns: 3
Pattern List: re1ppp, re1ppp, re0re0pp
Deduced From: re0ppp, re1ppp, re0re0pp
Best Defence(s): different from all re's of the pattern list
After playing a best defence move on one of the forked pattern sets specified under deduced from pattern sets hereunder this forked pset is disabled and the other forked pset remains active, in case of a siding fork, or becomes active, in case of a sharing fork, providing its winning move. In case of playing a best defence move outside of both forked pset's, both forked pset's remain active providing their winning moves.
Deduced From Pattern Sets:
Pset 1.s.1 (re0ppp, Winning Move: re0 of re0ppp, Deduction Path: Disc Omission on Pattern)
Pset 3.s.2 (re1ppp, re0re0pp, Winning Move: re1 of re1ppp and re0 of re0re0pp different from re1 of re1ppp (from identical pset 3.s.4), Deduction Path: Disc Omission on Pattern and on Depth of the Other Pattern)
Deduction Source for Pattern Sets:
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.
- 112WinningDefensibleEmptyEqual: The winning re of the first deduced from pset is on the same column as the defensible re of the second deduced from pset. In other words the winning re and the defensible re of the psets being forked must be on a same column.
- AfterTwoMovesNoFasterWinForOpponent: After any of all the opponents best defensive move(s) and then the players subsequent winning move(s), as specified by the winning move property of the concerned deduced from pset, no pattern set (pset) of the opponent may exist on the board that implies a faster win for the opponent. For example for psets 4.x.y (connects 4 in 4 moves) no psets 1.v.w (connects 4 in 1 move) of the opponent may exist after all moves specified above.
This pattern sets video:
https://rumble.com/v6qkih4-standalone-pset-4.s.7-connect-4in4-moves-pattern-recognition-deduction-hi-h.html
Connect 4 Board Example List:
SPSPSPSSSEPSSPPPEPPSPESESEPEEEEEEEEEEEEEEEE
SPSPSSPPSESPSSPPEPPSPEEEEEPSEEEEEESEEEEEEEE
SPSPSSPPSESPSSPPEPPSPEEESEPSEEEEEEEEEEEEEEE |