博弈复杂度 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "博弈复杂度" in Chinese language version.

refsWebsite

Global rank Chinese rank

20web.archive.org

1^st place

10maastrichtuniversity.nl

low place

8doi.org

2^nd place

23^rd place

3arxiv.org

69^th place

254^th place

2acm.org

1,185^th place

809^th place

2cwi.nl

low place

1msri.org

low place

1nih.gov

4^th place

5^th place

1ams.org

451^st place

935^th place

1webcitation.org

24^th place

29^th place

1computerhistory.org

2,213^th place

4,242^nd place

1nips.cc

low place

6,768^th place

1ndhu.edu.tw

low place

1,481^st place

1washington.edu

1,067^th place

1,375^th place

1psu.edu

207^th place

628^th place

1icosahedral.net

low place

1janzert.com

low place

acm.org

portal.acm.org

ams.org

emis.ams.org

G.I. Bell. The Shortest Game of Chinese Checkers and Related Problems. Integers. 2009 [2020-03-24]. arXiv:0803.1245 . （原始内容存档于2019-09-02）.

arxiv.org

G.I. Bell. The Shortest Game of Chinese Checkers and Related Problems. Integers. 2009 [2020-03-24]. arXiv:0803.1245 . （原始内容存档于2019-09-02）.
Donghwi Park. Space-state complexity of Korean chess and Chinese chess. 2015 [2015-08-19]. （原始内容存档于2020-08-01）.
R. A. Hearn. Amazons is PSPACE-complete. 2005-02-02. arXiv:cs.CC/0502013 .

computerhistory.org

archive.computerhistory.org

The size of the state space and game tree for chess were first estimated in Claude Shannon. Programming a Computer for Playing Chess (PDF). Philosophical Magazine. 1950, 41 (314) [2014-02-12]. （原始内容 (PDF)存档于2010-03-15）. Shannon gave estimates of 10⁴³ and 10¹²⁰ respectively, smaller than the upper bound in the table, which is detailed in Shannon number.

cwi.nl

John Tromp. John's Connect Four Playground. 2010 [2014-02-12]. （原始内容存档于2003-04-08）.
John Tromp and Gunnar Farneb?ck. Combinatorics of Go. 2007. ^{[永久失效連結]} This paper derives the bounds 48<log(log(N))<171 on the number of possible games N.

doi.org

H. J. van den Herik; J. W. H. M. Uiterwijk; J. van Rijswijck. Games solved: Now and in the future. Artificial Intelligence. 2002, 134 (1–2): 277–311. doi:10.1016/S0004-3702(01)00152-7.
Jonathan Schaeffer; et al. Checkers is Solved. Science. July 6, 2007, 317 (5844): 1518–1522. PMID 17641166. doi:10.1126/science.1144079.
J. M. Robson. N by N checkers is Exptime complete. SIAM Journal on Computing,. 1984, 13 (2): 252–267. doi:10.1137/0213018.
M.P.D. Schadd, M.H.M. Winands, J.W.H.M. Uiterwijk, H.J. van den Herik and M.H.J. Bergsma. Best Play in Fanorona leads to Draw (PDF). New Mathematics and Natural Computation. 2008, 4 (3): 369–387 [2014-02-12]. doi:10.1142/S1793005708001124. （原始内容存档 (PDF)于2020-10-25）.
Takumi Kasai, Akeo Adachi, and Shigeki Iwata. Classes of Pebble Games and Complete Problems. SIAM Journal on Computing. 1979, 8 (4): 574–586. doi:10.1137/0208046. Proves completeness of the generalization to arbitrary graphs.
S. Iwata and T. Kasai. The Othello game on an n*n board is PSPACE-complete. Theor. Comp. Sci. 1994, 123 (2): 329–340. doi:10.1016/0304-3975(94)90131-7.
Chang-Ming Xu; Ma, Z.M.; Jun-Jie Tao; Xin-He Xu. Enhancements of proof number search in connect6. 2009 Chinese Control and Decision Conference. 2009: 4525. ISBN 978-1-4244-2722-2. doi:10.1109/CCDC.2009.5191963.
Hiroyuki Iida, Makoto Sakuta, Jeff Rollason. Computer shogi. Artificial Intelligence. january 2002, 134 (1–2): 121–144. doi:10.1016/S0004-3702(01)00157-6. 请检查|date=中的日期值 (帮助)

icosahedral.net

David Jian Wu. Move Ranking and Evaluation in the Game of Arimaa (PDF). 2011 [2014-02-12]. （原始内容存档 (PDF)于2017-03-17）.

janzert.com

arimaa.janzert.com

Brian Haskin. A Look at the Arimaa Branching Factor. 2006 [2014-02-12]. （原始内容存档于2009-11-07）.

maastrichtuniversity.nl

project.dke.maastrichtuniversity.nl

Victor Allis. Searching for Solutions in Games and Artificial Intelligence (PDF) (Ph.D.论文). University of Limburg, Maastricht, The Netherlands. 1994 [2014-02-12]. ISBN 90-900748-8-0. （原始内容存档 (PDF)于2020-09-27）.
Robert Briesemeister. Analysis and Implementation of the Game OnTop (PDF) (学位论文). Maastricht University, Dept of Knowledge Engineering. 2009 [2014-02-12]. （原始内容存档 (PDF)于2014-03-06）.
Chorus, Pascal. Implementing a Computer Player for Abalone Using Alpha-Beta and Monte-Carlo Search (PDF). Dept of Knowledge Engineering, Maastricht University. [29 March 2012]. （原始内容存档 (PDF)于2020-09-18）.
Joosten, B. Creating a Havannah Playing Agent (PDF). [29 March 2012]. （原始内容存档 (PDF)于2016-03-03）.
Cathleen Heyden. Implementing a Computer Player for Carcassonne (PDF) (学位论文). Maastricht University, Dept of Knowledge Engineering. 2009 [2014-02-12]. （原始内容存档 (PDF)于2014-03-06）.
P. P. L. M. Hensgens. A Knowledge-Based Approach of the Game of Amazons (PDF). Universiteit Maastricht, Institute for Knowledge and Agent Technology. 2001 [2014-02-12]. （原始内容存档 (PDF)于2016-03-03）.
Christ-Jan Cox. Analysis and Implementation of the Game Arimaa (PDF). 2006 [2014-02-12]. （原始内容存档 (PDF)于2020-10-27）.
A.F.C. Arts. Competitive Play in Stratego (PDF) (学位论文). Maastricht. 2010 [2014-02-12]. （原始内容存档 (PDF)于2016-03-04）.

dke.maastrichtuniversity.nl

M.P.D. Schadd, M.H.M. Winands, J.W.H.M. Uiterwijk, H.J. van den Herik and M.H.J. Bergsma. Best Play in Fanorona leads to Draw (PDF). New Mathematics and Natural Computation. 2008, 4 (3): 369–387 [2014-02-12]. doi:10.1142/S1793005708001124. （原始内容存档 (PDF)于2020-10-25）.
Mark H.M. Winands. Informed Search in Complex Games (PDF) (Ph.D.论文). Maastricht University, Maastricht, The Netherlands. 2004 [2014-02-12]. ISBN 90-5278-429-9. （原始内容存档 (PDF)于2020-07-31）.

msri.org

Hilarie K. Orman: Pentominoes: A First Player Win in Games of no chance （页面存档备份，存于互联网档案馆）, MSRI Publications – Volume 29, 1996, pages 339-344. Online: pdf （页面存档备份，存于互联网档案馆）.

ndhu.edu.tw

csie.ndhu.edu.tw

Shi-Jim Yen, Jr-Chang Chen, Tai-Ning Yang, and Shun-Chin Hsu. Computer Chinese Chess (PDF). International Computer Games Association Journal. March 2004, 27 (1): 3–18 [2014-02-12]. （原始内容 (PDF)存档于2007-06-14）.

nih.gov

ncbi.nlm.nih.gov

Jonathan Schaeffer; et al. Checkers is Solved. Science. July 6, 2007, 317 (5844): 1518–1522. PMID 17641166. doi:10.1126/science.1144079.

nips.cc

books.nips.cc

存档副本. [2008-04-15]. （原始内容存档于2009-02-26）.

psu.edu

citeseerx.ist.psu.edu

Julien Kloetzer; Hiroyuki Iida; Bruno Bouzy. The Monte-Carlo Approach in Amazons. 2007 [2014-02-12]. （原始内容存档于2012-10-17）.

washington.edu

hyperion.cs.washington.edu

Lisa Glendenning. Mastering Quoridor (PDF). Computer Science (B.Sc.论文). University of New Mexico. May 2005 [2014-02-12]. （原始内容 (PDF)存档于2012-03-15）.

web.archive.org

Victor Allis. Searching for Solutions in Games and Artificial Intelligence (PDF) (Ph.D.论文). University of Limburg, Maastricht, The Netherlands. 1994 [2014-02-12]. ISBN 90-900748-8-0. （原始内容存档 (PDF)于2020-09-27）.
Hilarie K. Orman: Pentominoes: A First Player Win in Games of no chance （页面存档备份，存于互联网档案馆）, MSRI Publications – Volume 29, 1996, pages 339-344. Online: pdf （页面存档备份，存于互联网档案馆）.
John Tromp. John's Connect Four Playground. 2010 [2014-02-12]. （原始内容存档于2003-04-08）.
M.P.D. Schadd, M.H.M. Winands, J.W.H.M. Uiterwijk, H.J. van den Herik and M.H.J. Bergsma. Best Play in Fanorona leads to Draw (PDF). New Mathematics and Natural Computation. 2008, 4 (3): 369–387 [2014-02-12]. doi:10.1142/S1793005708001124. （原始内容存档 (PDF)于2020-10-25）.
G.I. Bell. The Shortest Game of Chinese Checkers and Related Problems. Integers. 2009 [2020-03-24]. arXiv:0803.1245 . （原始内容存档于2019-09-02）.
Mark H.M. Winands. Informed Search in Complex Games (PDF) (Ph.D.论文). Maastricht University, Maastricht, The Netherlands. 2004 [2014-02-12]. ISBN 90-5278-429-9. （原始内容存档 (PDF)于2020-07-31）.
Robert Briesemeister. Analysis and Implementation of the Game OnTop (PDF) (学位论文). Maastricht University, Dept of Knowledge Engineering. 2009 [2014-02-12]. （原始内容存档 (PDF)于2014-03-06）.
存档副本. [2008-04-15]. （原始内容存档于2009-02-26）.
Shi-Jim Yen, Jr-Chang Chen, Tai-Ning Yang, and Shun-Chin Hsu. Computer Chinese Chess (PDF). International Computer Games Association Journal. March 2004, 27 (1): 3–18 [2014-02-12]. （原始内容 (PDF)存档于2007-06-14）.
Donghwi Park. Space-state complexity of Korean chess and Chinese chess. 2015 [2015-08-19]. （原始内容存档于2020-08-01）.
Chorus, Pascal. Implementing a Computer Player for Abalone Using Alpha-Beta and Monte-Carlo Search (PDF). Dept of Knowledge Engineering, Maastricht University. [29 March 2012]. （原始内容存档 (PDF)于2020-09-18）.
Joosten, B. Creating a Havannah Playing Agent (PDF). [29 March 2012]. （原始内容存档 (PDF)于2016-03-03）.
Lisa Glendenning. Mastering Quoridor (PDF). Computer Science (B.Sc.论文). University of New Mexico. May 2005 [2014-02-12]. （原始内容 (PDF)存档于2012-03-15）.
Cathleen Heyden. Implementing a Computer Player for Carcassonne (PDF) (学位论文). Maastricht University, Dept of Knowledge Engineering. 2009 [2014-02-12]. （原始内容存档 (PDF)于2014-03-06）.
Julien Kloetzer; Hiroyuki Iida; Bruno Bouzy. The Monte-Carlo Approach in Amazons. 2007 [2014-02-12]. （原始内容存档于2012-10-17）.
P. P. L. M. Hensgens. A Knowledge-Based Approach of the Game of Amazons (PDF). Universiteit Maastricht, Institute for Knowledge and Agent Technology. 2001 [2014-02-12]. （原始内容存档 (PDF)于2016-03-03）.
Christ-Jan Cox. Analysis and Implementation of the Game Arimaa (PDF). 2006 [2014-02-12]. （原始内容存档 (PDF)于2020-10-27）.
David Jian Wu. Move Ranking and Evaluation in the Game of Arimaa (PDF). 2011 [2014-02-12]. （原始内容存档 (PDF)于2017-03-17）.
Brian Haskin. A Look at the Arimaa Branching Factor. 2006 [2014-02-12]. （原始内容存档于2009-11-07）.
A.F.C. Arts. Competitive Play in Stratego (PDF) (学位论文). Maastricht. 2010 [2014-02-12]. （原始内容存档 (PDF)于2016-03-04）.

webcitation.org

The size of the state space and game tree for chess were first estimated in Claude Shannon. Programming a Computer for Playing Chess (PDF). Philosophical Magazine. 1950, 41 (314) [2014-02-12]. （原始内容 (PDF)存档于2010-03-15）. Shannon gave estimates of 10⁴³ and 10¹²⁰ respectively, smaller than the upper bound in the table, which is detailed in Shannon number.