Grain of Salt - January 2nd, 2012
[
entries
|
archive
|
friends
|
userinfo
]
snauts
[
userinfo
|
sc userinfo
]
[
archive
|
journal archive
]
January 2nd, 2012
[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
1 comment
|
post comment
navigation
[
viewing
|
January 2nd, 2012
]
[
go
|
Previous Day
|
Next Day
]