Two players, A and B, are playing an asymmetrical game. There are n points on the game board. Each turn player A targets a pair of points and player B says whether those two points are connected or unconnected. A can target each pair only once and the game ends when all pairs have been targeted. Player B wins iff a point is connected with all other points on the very last turn, while player A wins if any point is connected with all other points on any turn but the very last one OR if no point is connected to all other points after the last turn. For what values of n does either player have a winning strategy?

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.4: Applications
Problem 26EQ
icon
Related questions
Question

Two players, A and B, are playing an asymmetrical game. There are n points on the game board. Each turn player A targets a pair of points and player B says whether those two points are connected or unconnected. A can target each pair only once and the game ends when all pairs have been targeted. Player B wins iff a point is connected with all other points on the very last turn, while player A wins if any point is connected with all other points on any turn but the very last one OR if no point is connected to all other points after the last turn. For what values of n does either player have a winning strategy? 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning