Обсуждение @ 1622. Endspiel @ Timus Online Judge

Vedernikoff Sergey (HSE: EconomicsForever!) How to prove the result??? [9] // Задача 1622. Endspiel 23 авг 2008 22:30

How to prove that only for you-know-what cells there exists an answer?

Denis Koshman Re: How to prove the result??? // Задача 1622. Endspiel 1 сен 2008 09:20

I brute-forced it (~30 mins as I used 1Gb RAM computer, so I had to calculate 1, 2, 3, ... n steps separately and store results on HDD for further path-tracing between reachable states).

Edited by author 09.09.2008 02:52

Брэнд * [6] // Задача 1622. Endspiel 24 окт 2008 23:57

It's very easy task if you know the game "Soliter"))

LDT Re: * [5] // Задача 1622. Endspiel 30 окт 2008 13:59

Брэнд писал(a) 24 октября 2008 23:57

It's very easy task if you know the game "Soliter"))

can you tell more about that?

Maxim Dvoynishnikov (Dnipropetrovsk SU) Re: * [4] // Задача 1622. Endspiel 30 окт 2008 19:42

http://en.wikipedia.org/wiki/Solitaire

Vedernikoff Sergey (HSE: EconomicsForever!) Re: * [3] // Задача 1622. Endspiel 31 окт 2008 03:25

And how does this solitaire help to solve the problem?

LDT Re: * // Задача 1622. Endspiel 3 ноя 2008 01:43

yes, i don't see any relation with the solitarie. Although i've played many times (in the past)

2rf [Perm School #9] Re: * [1] // Задача 1622. Endspiel 17 июн 2010 16:35

This is solitaire he meant:
http://en.wikipedia.org/wiki/Peg_solitaire

Sevenk Re: * // Задача 1622. Endspiel 22 июн 2010 17:18

Oh, you showed us the solution.

SPb-MaxBuzz Re: How to prove the result??? // Задача 1622. Endspiel 24 ноя 2008 08:39

Well, try coloring the cells of the field in numbers 3,5,6 so that in each row they repeat: 3,5,6,3,5,6,... and the top-left to bottom-right diagonals are always "one-color". Then play with possible moves and XORs of the values. Then change the direction of one-color diagonals and repeat all the reasoning. This will certainly help you.

Обсуждение задачи 1622. Endspiel