Talk:Sokoban: Difference between revisions
Content added Content deleted
No edit summary |
(Guide to draft.) |
||
| Line 2: | Line 2: | ||
:There is no particular solution algorithm besides mostly brute-forcing it. It's a PSPACE-complete problem. There are various ways that make the brute force approach less painful though, like working the problem backwards. (Also, what does draft-status have to do with how easy the problem is? I'm asking since I'm somewhat new here.) [[User:MagiMaster|MagiMaster]] 09:36, 28 May 2011 (UTC) |
:There is no particular solution algorithm besides mostly brute-forcing it. It's a PSPACE-complete problem. There are various ways that make the brute force approach less painful though, like working the problem backwards. (Also, what does draft-status have to do with how easy the problem is? I'm asking since I'm somewhat new here.) [[User:MagiMaster|MagiMaster]] 09:36, 28 May 2011 (UTC) |
||
:: Hi MagiMaster, we usually keep draft status until their are around four good examples and no niggling problems outstanding in the talk page; but that is a guide. --[[User:Paddy3118|Paddy3118]] 12:52, 28 May 2011 (UTC) |
|||
Revision as of 12:52, 28 May 2011
Added draft status as task doesn't seem that easy. No solution algorithm is even hinted at on the wp page. --Paddy3118 05:41, 28 May 2011 (UTC)
- There is no particular solution algorithm besides mostly brute-forcing it. It's a PSPACE-complete problem. There are various ways that make the brute force approach less painful though, like working the problem backwards. (Also, what does draft-status have to do with how easy the problem is? I'm asking since I'm somewhat new here.) MagiMaster 09:36, 28 May 2011 (UTC)
- Hi MagiMaster, we usually keep draft status until their are around four good examples and no niggling problems outstanding in the talk page; but that is a guide. --Paddy3118 12:52, 28 May 2011 (UTC)