There is nothing unusual about a solver failing to solve this or that level. There are tens of thousands of levels which always will be out of reach for a...
Here's one for y'all... Sokoban GP2X Win - seversokoban 153 (of 183); written by Erim Sever ############### #--########---# #-------------# #--$*******$-## ...
Eric, This puzzle have solution? I'm very stuck... ######### #-------# #-#####-######## #-----#--##----## #-$-$$#-$.......# #--$--##$#......# #-$@$-##-#......#...
Hello. I write a sokoban batch script for windows xp 32 bits. Url for download: http://sites.google.com/site/sokobanbatch/home/sokoban3.zip?attredirects=0&d=1...
... That's right; when the boxes have been lined up either by row or by column, then it's trivial to solve the level from that point. As you write, the...
Thank you Brian for doing an excellent summary on the checker-board levels! I don't know if there is a "mechanical" way to solve the C type levels. However, I...
... Come to think of it, the Sasquatch II-17 level isn't a regular checkerboard level because it misses a goal square in the middle. Before we leave the...
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...
... 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...
... 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'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...
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...
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...
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...
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...
To answer my own question : "C" version of Carlos 60 boxes level can be done in 60 pushes ################### #-----------------# #-$.$.$.$.$.$.$.$-# ...
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 ...
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...
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...
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,...
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...
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...
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...
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.
