Grain of Salt -
[
entries
|
archive
|
friends
|
userinfo
]
snauts
[
userinfo
|
sc userinfo
]
[
archive
|
journal archive
]
[Jan. 2nd, 2012|
03:01 pm
]
"The problem of solving Sokoban puzzles has been proven to be NP-hard."
...
"The more complex Sokoban levels are, however,
out of reach even for the best automated solvers."
link
post comment
Comments:
From:
mindbound
Date:
January 2nd, 2012 - 10:28 pm
(
Link
)
Ļoti interesanti indeed, nebiju zinājis.
(
Reply to this
)