QUEST: Sokoban level

[ StratOS @ 14.01.2004. 11:56 ] @

Pozdrav, evo vam jednog vrednog questa !

Radi se o igri sokoban !
Trebate da napravite nove ES levele.
Prije dosta vremena napravio sam VB program sokoban za igranje, a sada ču postaviti jedan quest, ko če napraviti bolje xsb sokoban levele !

Sokoban je stara japanska igra, radi se o skladistaru, koji mora da mova boxeve na prave pozicije (targete), on moze da gura samo jedan box i ne moze da gura stijene (wall), on moze da samo mova a ne da pulla te boxeve.

Level je treba napraviti u xsb formatu
Vishe informacija o tom standardu http://www.clickfest88.freeserve.co.uk/xsbformat.html

radi se os sledecem standardu fajlova:

@ - sokoban
+ - sokoban na targetu
# - stjena, zid
$ - box - to treba da soko mova do targeta
* - box na targetu
. - target
" " - space - prazno polje po kome se soko moze da mova

Evo primjera jednog texstovnog fajla :

Code:

    ####
####   #
#@$  # #
# $$$  #
##.#.  #
#  ..# #
#  #.* #
# $.$ #
##   #
######
Author: D Holland + sokgen
Title: ninevah
Comment:Broj pusheva/mova  30/120 (primjer)
Rjesenje: LlRrDdUu itd ...                  (primjer)

U jednom faju mozete da imate cak i vishe levela medzu sebe razdvojenim sa novom linijom
Primjer :

Code:

Set-Title: Original levels
Set-Author: Thinking Rabbit
Set-Copyright: (c) 1982 Thinking Rabbit
Set-Website: unknown
Set-Email: unknown
Set-Comment:
These are the first two levels.
Set-Comment-End:

; this is some additional information, not meant for parsing

    #####
    #   #
    #$  #
  ###  $##
  #  $ $ #
### # ## #   ######
#   # ## #####  ..#
# $  $          ..#
##### ### #@##  ..#
    #     #########
    #######
Title: Level 1
Author: Thinking Rabbit
Comment:
Comment-End:

############
#..  #     ###
#..  # $  $  #
#..  #$####  #
#..    @ ##  #
#..  # #  $ ##
###### ##$ $ #
  # $  $ $ $ #
  #    #     #
  ############
Title: Level 2
Author: Thinking Rabbit
Comment:
Comment-End:

Za lazi rad za levele evo vam i malo pomoči

R-box je sjajan ms-dos program za izradu i proveru dali je level rjesljiv, kreaciju novih levela iz osnovnog, velik cca 40 KB http://sokomind.de/sokomind/files/rbox-r1.zip

Paul Voyer's IE java programcic za ispitavanje levela http://paul.voyer.free.fr/
za one sa min 64 MB rama http://paul.voyer.free.fr/sokoban/Solveur56.zip
za one sa min 256 MB rama http://paul.voyer.free.fr/sokoban/solveur224.html

Evo mozete da probavate svoj level sa razlicitim programima
Moj favourite sokomind http://www.sokomind.de/sokomind/files/sokomd34.exe

Evo sada malo o questu :
-Level mora da bude rjesljiv
-max. velicina polja je 15 x 15 !
-pobjednik questa je onaj koji napravi level sa najvishe pusheva a ne poteza !
-Sami treba da kreirate levele ( bez plagiatorstva )
-ako bude dosta ugodnih levela dajem mogucnost da napravimo nas ES sokoban levele za moj program.
-Svaki level treba da ima deskripciju Autora, kratak komentar na kraju i po mogucnosti minimalni broj pusheva/mova (koristite gornje programe !)

P.S.:Koristenje navedutih programov je mukotrpno za vas comp, ako ima malo rama i slab procesor.Koristenje programa na vlastitu odgovornost !

Ajde da vas vidimo ...

[Ovu poruku je menjao StratOS dana 15.01.2004. u 11:43 GMT]

[Ovu poruku je menjao StratOS dana 15.01.2004. u 11:45 GMT]

[ noviKorisnik @ 14.01.2004. 12:53 ] @

Da predloge kačimo kao fajlove ili

Code:
@$.

Koliko minimalno pusheva pre objavljivanja u questu?

[ StratOS @ 15.01.2004. 09:16 ] @

Pa zar sam i u tome pogledu dao kakve restrikcije ?
Nisam !
Sam češ vidjeti, ako barem ima malo kooperacije koliko su ti brojevi
A sto se levela tice mozes da jih attachujes u attachementu (bez kakvog zipanja itd ...

Evo jednog primjera fajl 10000.out

Code:

###########
#  #####  #
#    $  $ #
# ..$# .. #
## . #$.$##
## .$# . ##
###  #$$###
###  # @###
###########

sa programom rbox
rbox -m 10000.out (treba malo vremena da skalkulira) ili rbox 10000.out
ili sa java programcicem dobivamo sledeče :

Solution in 315 moves and 84 pushes :
UUUUluLLLdlluurDDrurrrdrrruulDLLLLLrrrdrddlUruullllddrDluuurDurrrddlUruLdddrddl
UUruuurrdLulDDDrUluurrdLulDluLLdlddrUldddrUluuulluurDRRRRRllllddrUldddrUluuulld
RurDDDuuuRRRdrrruulDrdLddllUdrruuuLLLLLrrrrrdddlluUddrruuulLLLdlddrUlulluurDRRR
RRllllddrUlulldRurDuRRRdddrruuruulDLLdddddrUluuuuLLLdlluurDldRurrdddllUdrrddlU

program rbox je dobar ako ga znate da upotrebite pravilno. Brzina rjesenja je odvisna od parametara i switcheva. Moj trenutacno favourite je java programcic, no on ima male restrikcije polja i broj targeta !
Za rbox :

Code:

Legal options are:
   -b: Print the board after reading it
   -c <file>: Compare with board in <file>
   -d: Print board and quit
   -f <file>: Give file with 64-bit random values
   -h: Output all hash size info
   -i <hval>: Seed random function with hex value <hval>
   -l <size>: Set bucket size to <size>
   -m: Solve with a minimum of moves
   -p <path>: Backsolve solved board to find boards with a maximum number of
              pushes from the given board. Save the boards to <path>nnnn
   -q: Don't output progress
   -s <n>: Try to solve the puzzle starting with ply <n>
      For option -p, give start level for saving boards
   -t: Don't output time used
   -v: Verbose
   -x <bits>: Set number of bits used for hash index to <bits>

-m switch če obraditi fajl sa minimum mova (default pusheva)
-p za kreaciju novih levela od levela u fajlu
-s,-x,-l su parametri od kojih je odvisna brzina rjesenja tog programa

za vishe informacija procitajte *.doc u rbox zipu !
Ajde sada da iz jednog levela napravimo vishe sličnih sa rbox-om!

primjer fajl 1.txt:

Code:

      ####
#######  #
#        #
#  $ #.# #
# $$## # ##
### . @   #
  ###  #  #
    ##.  ##
     #####

nas osnovni level 1.txt rjesljiv je :
C:\WINDOWS\Namizje>rbox -m 1.txt
The hash table can store 2097152 positions, allocating 16 Mbytes for it !
An upper bound for the number of possible box configurations are 2024 !
An upper bound for the number of possible configurations are 64768 !

  Time used (Time diff) Moves  Nodes      Inhash    Reused
      3.460      0.000  177    9003715    47333     0
Solution: uuulldLrurrdddlllUdrrruuulllllddRUluRRRdLruRRRurDDDDllddrrUruLLrddlluU
lllUlUluRRRRRRurDDDDllddrrUruLddllululluUluRRRRRurDDDDLLddrrUruLuuulldDDDuuuulll
dddrRdrUllluururrrrdddLLLrU !
Solved with 177 moves and 56 pushes !
Clock: 3460, Time used: 3.460

a sad napravimo par novih levela istog :
C:\WINDOWS\Namizje>rbox -p 1 1.txt
The hash table can store 2097152 positions, allocating 16 Mbytes for it !
An upper bound for the number of possible box configurations are 2024 !
An upper bound for the number of possible configurations are 64768 !

  Time used (Time diff) Pulls  Nodes      Inhash    Reused
      0.000      0.000  3      10         4         0
A maximum of 2 pushes can be done from the initial position giving 1 positions !

Clearing last level hash entries !
Cleared 1 entries !
Researching:
Saved 1 boards which can be reached with 2 pushes or more !
Clock: 160, Time used: 0.160

pogledamo koliko treba za rjesenje novom levelu (10000.out):
C:\WINDOWS\Namizje>rbox -m 10000.out
The hash table can store 2097152 positions, allocating 16 Mbytes for it !
An upper bound for the number of possible box configurations are 2024 !
An upper bound for the number of possible configurations are 64768 !

  Time used (Time diff) Moves  Nodes      Inhash    Reused
      3.350      0.000  149    8995549    47333     0
Solution: llddRUluRRRdLruRRRurDDDDllddrrUruLLrddlluUlllUlUluRRRRRRurDDDDllddrrUr
uLddllululluUluRRRRRurDDDDLLddrrUruLuuulldDDDuuuullldddrRdrUllluururrrrdddLLLrU
!
Solved with 149 moves and 54 pushes !
Clock: 3350, Time used: 3.350

Ajde sad samo isprobajte ...

Pogledajte i attachement !