Full metadata record
DC FieldValueLanguage
dc.contributor.author詹宜智en_US
dc.contributor.authorChan, Yi-Chihen_US
dc.contributor.author吳毅成en_US
dc.contributor.authorWu, I-Chenen_US
dc.date.accessioned2014-12-12T01:33:51Z-
dc.date.available2014-12-12T01:33:51Z-
dc.date.issued2009en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT079655512en_US
dc.identifier.urihttp://hdl.handle.net/11536/43315-
dc.description.abstract六子棋是在 2005 年所發表的新棋類遊戲,由於六子棋是很新的遊戲,需要更多的開局庫和詰棋題目。本論文發展了一套六子棋證明系統,結合阿法貝塔搜尋(Alpha-Beta Search)和證明數之搜尋(Proof Number Search),能展開較少節點,並快速證明兩人對局遊戲之勝負。同時,此系統亦可在網格運算系統上,加快計算速度。本系統所產生的盤面勝負結果,除了能提供開局庫參考,還能提昇六子棋電腦程式的強度。zh_TW
dc.description.abstractConnect6 was introduced in 2005. We need to develop more openings and puzzles since Connect6 is a very young game. This thesis develops a proof system for Connect6. It combines alpha-beta search and proof number search to expand less nodes and prove two-person games more quickly. Grid systems are also used to accelerate computation. The results of proof system are not only put into the opening database but also improve the strength of Connect6 program.en_US
dc.language.isozh_TWen_US
dc.subject六子棋zh_TW
dc.subject阿法貝塔搜尋zh_TW
dc.subject證明樹之搜尋zh_TW
dc.subject開局庫zh_TW
dc.subjectConnect6en_US
dc.subjectAlpha-Beta Searchen_US
dc.subjectProof Number Searchen_US
dc.subjectOpening DataBaseen_US
dc.title適用於六子棋之平行PNS研究zh_TW
dc.titleParallel Proof Number Search for Connect6en_US
dc.typeThesisen_US
dc.contributor.department資訊科學與工程研究所zh_TW
Appears in Collections:Thesis