PS1 Solution - Kaushik Basu Fall 2009 Econ 367 :...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Kaushik Basu Fall 2009 Econ 367 : Game-Theoretic Methods Problem Set 1 1. In the game of Hex we proved that Black does not have a winning strategy. The proof took the form of showing that if Black has a winning strategy then White can always win (which is of course a contradiction). Why can we not construct a similar proof to show that White does not have a winning strategy? Being able to answer this question to your satisfaction will help you understand properly the original proof (that is, of why Black does not have a winning strategy). ANSWER: The reason we cannot construct a similar proof for White is because White moves first. Since White is the first mover, Black cannot put his stone where White has put his should the book indicate to do so. 2. Try to write down in words why in chess you cannot use the kind of argument used in Hex to show that Black does not have a winning strategy. ANSWER: Remember that in the proof in Hex, we assume Black has a winning
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/03/2009 for the course ECON 3670 taught by Professor Basu during the Fall '08 term at Cornell University (Engineering School).

Page1 / 2

PS1 Solution - Kaushik Basu Fall 2009 Econ 367 :...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online