|
BGonline.org Forums
n odd
Posted By: Bob Koca In Response To: Another puzzle/ next question/ SPOILER I hope)_ (Bob Koca)
Date: Sunday, 16 May 2010, at 5:33 p.m.
I suggested before that B can force the game into a position with N (N-1) X's forcing A to lose on his next placement. My strategy for doing that was shown not to work by Nack. I have a modification to it that I think works.
The danger to B is that a position is reached in which there are two lines with n-1 X's with the missing X being in same row or column. e.g.
X X X X *
X X X X *
& & & & &
& & & & &
& & & & &
where * are not filled in and & are possibly filled in.
To avoid this player B must prevent that: Whenever A causes a n-1 and n-2 situation such as
X X X X *
X X X * *
& & & & &
& & & & &
& & & & &
B must "block" by playing in 5th column of row 2. Otherwise B will play by filling in a row column with the fewst number of X's.
Why does this work? I would have to wave my hands too vigorously for someone who is unflappable. If false it shouldn't be too hard to disprove though.
|
BGonline.org Forums is maintained by Stick with WebBBS 5.12.