SokoSave Mobile v345 has been released. SokoSave Mobile is a version of Sokoban for Pocket PC devices running Windows Mobile 6, 5, and 2003. It supports...
... There is no point in introducing this confusion by falsely calling this level collection "PolyCosmos". As can be seen on the Author's website, the correct,...
... The included gamepacks are largely irrelevant, as all you need to do is download any collection from anywhere and point your sokoban clone at them. Between...
The 'variant' that I use is an unsupported one called Sokomind. Although it's not the prettiest one available, its interface and unlimited undo feature have...
... The other one I've seen mentioned is "Xsokoban", which is apparently a version made for Linux. "Sokoban GP2X" is freeware for Windows 95/98/XP, and is...
... Yup, you did. With the answers everybody is posting - not just about the games themselves, but also the various level archives - I think I'm going into...
Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the sokoban group. File : /carlos & eric...
It's an interesting question whether it's possible to solve checkerboard levels with N boxes in N pushes. I used a solver program to find solutions with 36...
I think in the chessboards, in fact: * Minimum number of pushes = number of boxes ...if the pusher is located OFF the chessboard. However, when the board is...
Not sure about the 45-O version... but it's nice to know that for the 45-C level, it's possible to have a 45 push solution: Solution(pushes 45, moves 243,...
Ok, it works for the smaller. But nothing is proved. Fermat was thinking every 22n + 1 was prime, and he was wrong Did someone try the "C" version of Carlos 60...
For Fermat : 2^(2^n + 1) ... From: plamat To: sokoban@yahoogroups.com Sent: Wednesday, November 04, 2009 1:17 AM Subject: Re: [Sokoban] Re: What is the...
2^(2^n) + 1 is prime for n=1,2,3,4 ; Fermat thought they were all primes, Euler proved him he was wrong for n=5 http://fr.wikipedia.org/wiki/Nombre_de_Fermat ...
To answer my own question : "C" version of Carlos 60 boxes level can be done in 60 pushes ################### #-----------------# #-$.$.$.$.$.$.$.$-# ...
Thank you guys for all the checkerboard solutions! ... That's right. Personally, I doubt that it works in the general case, but of course, I'll be delighted...
Brian, I'd like to ask how do you optimize chessboards so big, and getting such excellent results?!! In chessboards of 50-80 boxes I never manage to get the...
Hi Jordi, I'm definitely *not* good at optimizing solutions. If you'd like to see what the real "magicians" can do when they strive for optimality, I can...
I agree with Brian and his 5 boxes-by-axis theory. The 66-0 could be the limit of the 1-push-per-box solutions for "O" levels. The 65-C could be the limit of...
... That's a splendid observation, Philippe! With 162 boxes, and compared to the other checkerboard solutions we've seen, I would have expected a best solution...
... Actually, a solution with less than 200 pushes was known for at least two years already. Since I didn't see the solution originator post his solution in...
... That makes me curious if I've overlooked something, because to me it seems easy enough to get the pusher out of the center without causing damage which...
Before we try to answer whether it's possible to have a one-push-per-box solution for level 17 of the Sasquatch II set, I think it's worth to look at smaller...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
