|
|
| Show all threads Hide all threads Show all messages Hide all messages | | Dose this problem have a way to find the answer intime? | zwqzwq | 1622. Endspiel | 3 Sep 2021 16:00 | 1 | Just like the title,I know how to solve this problem,becouse I have played the game before,and I know there is a way to move the chess.But if somebody dosen't play the game at all before,than how can he solve the problem?(Sorry for my poor English)
Edited by author 03.09.2021 16:00 | | How to prove the result??? | Vedernikoff Sergey (HSE: EconomicsForever!) | 1622. Endspiel | 22 Jun 2010 17:18 | 10 | How to prove that only for you-know-what cells there exists an answer? 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 * Брэнд 24 Oct 2008 23:57 It's very easy task if you know the game "Soliter")) Re: * LDT 30 Oct 2008 13:59 It's very easy task if you know the game "Soliter")) can you tell more about that? Re: * Maxim Dvoynishnikov (Dnipropetrovsk SU) 30 Oct 2008 19:42 Re: * Vedernikoff Sergey (HSE: EconomicsForever!) 31 Oct 2008 03:25 And how does this solitaire help to solve the problem? Re: * LDT 3 Nov 2008 01:43 yes, i don't see any relation with the solitarie. Although i've played many times (in the past) Re: * 2rf [Perm School #9] 17 Jun 2010 16:35 Re: * Sevenk 22 Jun 2010 17:18 Oh, you showed us the solution. 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. |
|
|
|
