On the Complexity of the Linear Sliding-Coin Puzzle
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 98 === Consider a line of n nickels and n pennies with all nickels arranged to the left of all pennies, where n >= 3. The puzzle asks the player to rearrange the coins such that nickels and pennies alternate in the line. In each move, the player is allowed to slid...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/96920020639531182613 |
id |
ndltd-TW-098NCTU5394070 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-098NCTU53940702016-04-18T04:21:31Z http://ndltd.ncl.edu.tw/handle/96920020639531182613 On the Complexity of the Linear Sliding-Coin Puzzle 硬幣移動問題的計算複雜度 Lin, Ting-Yu 林庭宇 碩士 國立交通大學 資訊科學與工程研究所 98 Consider a line of n nickels and n pennies with all nickels arranged to the left of all pennies, where n >= 3. The puzzle asks the player to rearrange the coins such that nickels and pennies alternate in the line. In each move, the player is allowed to slide k >= 2 adjacent coins to a new position without rotating. We prove that it takes at least n moves to solve the puzzle, and present algorithms to generate the optimal solutions for k = 2 and k = 3. We also propose a framework to extend solutions, and apply it successfully to construct optimal solutions for k = 4 and k = 5. Tsai, Shi-Chun 蔡錫鈞 2010 學位論文 ; thesis 47 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 98 === Consider a line of n nickels and n pennies with all nickels arranged to the left of all
pennies, where n >= 3. The puzzle asks the player to rearrange the coins such that nickels
and pennies alternate in the line. In each move, the player is allowed to slide k >= 2
adjacent coins to a new position without rotating.
We prove that it takes at least n moves to solve the puzzle, and present algorithms to
generate the optimal solutions for k = 2 and k = 3. We also propose a framework to
extend solutions, and apply it successfully to construct optimal solutions for k = 4 and
k = 5.
|
author2 |
Tsai, Shi-Chun |
author_facet |
Tsai, Shi-Chun Lin, Ting-Yu 林庭宇 |
author |
Lin, Ting-Yu 林庭宇 |
spellingShingle |
Lin, Ting-Yu 林庭宇 On the Complexity of the Linear Sliding-Coin Puzzle |
author_sort |
Lin, Ting-Yu |
title |
On the Complexity of the Linear Sliding-Coin Puzzle |
title_short |
On the Complexity of the Linear Sliding-Coin Puzzle |
title_full |
On the Complexity of the Linear Sliding-Coin Puzzle |
title_fullStr |
On the Complexity of the Linear Sliding-Coin Puzzle |
title_full_unstemmed |
On the Complexity of the Linear Sliding-Coin Puzzle |
title_sort |
on the complexity of the linear sliding-coin puzzle |
publishDate |
2010 |
url |
http://ndltd.ncl.edu.tw/handle/96920020639531182613 |
work_keys_str_mv |
AT lintingyu onthecomplexityofthelinearslidingcoinpuzzle AT líntíngyǔ onthecomplexityofthelinearslidingcoinpuzzle AT lintingyu yìngbìyídòngwèntídejìsuànfùzádù AT líntíngyǔ yìngbìyídòngwèntídejìsuànfùzádù |
_version_ |
1718226173447634944 |