DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Park, Sung-Soo | - |
dc.contributor.advisor | 박성수 | - |
dc.contributor.author | Kim, Sun-Hae | - |
dc.contributor.author | 김선해 | - |
dc.date.accessioned | 2011-12-14T04:08:25Z | - |
dc.date.available | 2011-12-14T04:08:25Z | - |
dc.date.issued | 2007 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=264232&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/40764 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 산업공학과, 2007.2, [ 23 p. ] | - |
dc.description.abstract | There is an interesting board game named Fiver. In this thesis, we prove that Fiver is always solvable in general width m, height n situation and find a polynomial-time algorithm giving a solution. Moreover, we investigate the reversibility of Fiver and also find a polynomial-time algorithm which determines whether it is reversible or not for given m, n. For a construction of algorithms and a proof of validity of algorithms, we use basic linear algebra facts in binary field. In our construction, we think imaginary width m, height infinity board. In addition, we investigate some properties of Fiver including inductive properties. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Fiver linear algebra | - |
dc.subject | Fiver 선형 대수 | - |
dc.title | (A) study for the solvability of Fiver by a linear algebraic approach | - |
dc.title.alternative | 선형 대수적 접근을 통한 Fiver의 해법 연구 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 264232/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 020053088 | - |
dc.contributor.localauthor | Park, Sung-Soo | - |
dc.contributor.localauthor | 박성수 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.