Suppose there are nine points located at (0,0) ; (1,0) ; (2,0) ; (0,1) ; (1,1) ; (2,1) ; (0,2) ; (1,2); (2,2)

Your opponent lets you move first. You are to remove the fewest amount of points necessary to prevent your opponent from forming a square. On their turn, they will be adding two points at a location of their choosing to build a square (if they can).

What is the least amount of points, and which ones are they, that you should remove.

## Question

## BMAD

Suppose there are nine points located at (0,0) ; (1,0) ; (2,0) ; (0,1) ; (1,1) ; (2,1) ; (0,2) ; (1,2); (2,2)

Your opponent lets you move first. You are to remove the fewest amount of points necessary to prevent your opponent from forming a square. On their turn, they will be adding two points at a location of their choosing to build a square (if they can).

What is the least amount of points, and which ones are they, that you should remove.

## Link to comment

## Share on other sites

## 4 answers to this question

## Recommended Posts

## Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.