Dominoes in a chessboard

For discussing Olympiad Level Combinatorics problems
User avatar
Phlembac Adib Hasan
Posts:1016
Joined:Tue Nov 22, 2011 7:49 pm
Location:127.0.0.1
Contact:
Dominoes in a chessboard

Unread post by Phlembac Adib Hasan » Mon Nov 07, 2016 10:10 pm

A $100\times 100$ chessboard is cut into dominoes ($1\times 2$ rectangles). Two persons play the following game: At each turn, a player glues together two adjacent cells (which were formerly separated by a cut-edge). A player loses if, after his turn, the $100\times 100$ chessboard becomes connected, i. e. between any two cells there exists a way which doesn't intersect any cut-edge. Which player has a winning strategy - the starting player or his opponent?
Welcome to BdMO Online Forum. Check out Forum Guides & Rules

Post Reply