The Design and Analysis of Minimum Moving Algorithm for Sokoban Game
碩士 === 國立臺灣師範大學 === 資訊教育研究所 === 90 === Sokoban game is a motion planning problem. The main challenge of this problem is to detect deadlock states and to reduce the search space with good stratagems. Previous researchers designed single-agent search methods to solve Sokoban game. Single-ag...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2002
|
Online Access: | http://ndltd.ncl.edu.tw/handle/65246077778697709529 |
id |
ndltd-TW-090NTNU0395029 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-090NTNU03950292015-10-13T12:43:34Z http://ndltd.ncl.edu.tw/handle/65246077778697709529 The Design and Analysis of Minimum Moving Algorithm for Sokoban Game 倉庫番遊戲之最少搬移演算法分析與研究 Tsai Ming-Yuan 蔡明原 碩士 國立臺灣師範大學 資訊教育研究所 90 Sokoban game is a motion planning problem. The main challenge of this problem is to detect deadlock states and to reduce the search space with good stratagems. Previous researchers designed single-agent search methods to solve Sokoban game. Single-agnet search methods dynamically build patterns to detect deadlock, but it can not ensure that the result of moving steps is minimal. In this thesis, we use backward search method to decrease deadlock states and to make deadlock detecting easily. In our experiments, we also find out that Skiplist has better performance than AVL-tree in inserting and searching data. Our algorithm can solve 63 out of 90 XSokoban games and find out those games’ minimal moving steps successfully, This result is better than previous researches. Lin Shun-Shii 林順喜 2002 學位論文 ; thesis 60 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣師範大學 === 資訊教育研究所 === 90 === Sokoban game is a motion planning problem. The main challenge of this problem is to detect deadlock states and to reduce the search space with good stratagems. Previous researchers designed single-agent search methods to solve Sokoban game. Single-agnet search methods dynamically build patterns to detect deadlock, but it can not ensure that the result of moving steps is minimal.
In this thesis, we use backward search method to decrease deadlock states and to make deadlock detecting easily. In our experiments, we also find out that Skiplist has better performance than AVL-tree in inserting and searching data. Our algorithm can solve 63 out of 90 XSokoban games and find out those games’ minimal moving steps successfully, This result is better than previous researches.
|
author2 |
Lin Shun-Shii |
author_facet |
Lin Shun-Shii Tsai Ming-Yuan 蔡明原 |
author |
Tsai Ming-Yuan 蔡明原 |
spellingShingle |
Tsai Ming-Yuan 蔡明原 The Design and Analysis of Minimum Moving Algorithm for Sokoban Game |
author_sort |
Tsai Ming-Yuan |
title |
The Design and Analysis of Minimum Moving Algorithm for Sokoban Game |
title_short |
The Design and Analysis of Minimum Moving Algorithm for Sokoban Game |
title_full |
The Design and Analysis of Minimum Moving Algorithm for Sokoban Game |
title_fullStr |
The Design and Analysis of Minimum Moving Algorithm for Sokoban Game |
title_full_unstemmed |
The Design and Analysis of Minimum Moving Algorithm for Sokoban Game |
title_sort |
design and analysis of minimum moving algorithm for sokoban game |
publishDate |
2002 |
url |
http://ndltd.ncl.edu.tw/handle/65246077778697709529 |
work_keys_str_mv |
AT tsaimingyuan thedesignandanalysisofminimummovingalgorithmforsokobangame AT càimíngyuán thedesignandanalysisofminimummovingalgorithmforsokobangame AT tsaimingyuan cāngkùfānyóuxìzhīzuìshǎobānyíyǎnsuànfǎfēnxīyǔyánjiū AT càimíngyuán cāngkùfānyóuxìzhīzuìshǎobānyíyǎnsuànfǎfēnxīyǔyánjiū AT tsaimingyuan designandanalysisofminimummovingalgorithmforsokobangame AT càimíngyuán designandanalysisofminimummovingalgorithmforsokobangame |
_version_ |
1716865077355741184 |