Hex (juego) (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hex (juego)" in Spanish language version.

refsWebsite

Global rank Spanish rank

2^nd place

2^nd place

3semanticscholar.org

11^th place

79^th place

6^th place

5^th place

7^th place

15^th place

2,921^st place

4,138^th place

1web.archive.org

1^st place

1^st place

26^th place

56^th place

archive.org

Gardner, M. (1959). The Scientific American Book of Mathematical Puzzles & Diversions. N.Y., N.Y.: Simon and Schuster. pp. 73–83. ISBN 0-226-28254-6. (requiere registro).

doi.org

dx.doi.org

Hayward, Ryan B.; Rijswijck, van, Jack (6 de octubre de 2006). «Hex and combinatorics». Discrete Mathematics 306 (19–20): 2515-2528. doi:10.1016/j.disc.2006.01.029.
David Gale (1979). «The Game of Hex and Brouwer Fixed-Point Theorem». The American Mathematical Monthly (Mathematical Association of America) 86 (10): 818-827. JSTOR 2320146. doi:10.2307/2320146.
Even, S.; Tarjan, R. E. (1976). «A Combinatorial Problem Which is Complete in Polynomial Space». Journal of the ACM 23 (4): 710-719. S2CID 8845949. doi:10.1145/321978.321989.
Stefan Reisch (1981). «Hex ist PSPACE-vollständig (Hex is PSPACE-complete)». Acta Informatica 15 (2): 167-191. S2CID 9125259. doi:10.1007/bf00288964.
Shannon, C. (1953). «Computers and Automata». Proceedings of the Institute of Radio Engineers 41 (10): 1234-41. S2CID 51666906. doi:10.1109/jrproc.1953.274273.

jstor.org

David Gale (1979). «The Game of Hex and Brouwer Fixed-Point Theorem». The American Mathematical Monthly (Mathematical Association of America) 86 (10): 818-827. JSTOR 2320146. doi:10.2307/2320146.

nytimes.com

Nasar, Sylvia (13 de noviembre de 1994). «The Lost Years of a Nobel Laureate». The New York Times. Consultado el 23 de agosto de 2017.

rand.org

Nash, John (feb. de 1952). Rand Corp. informe técnico D-1164: Some Games and Machines for Playing Them. https://www.rand.org/content/dam/rand/pubs/documents/2015/D1164.pdf Archivado el 21 de enero de 2017 en Wayback Machine.

semanticscholar.org

api.semanticscholar.org

Even, S.; Tarjan, R. E. (1976). «A Combinatorial Problem Which is Complete in Polynomial Space». Journal of the ACM 23 (4): 710-719. S2CID 8845949. doi:10.1145/321978.321989.
Stefan Reisch (1981). «Hex ist PSPACE-vollständig (Hex is PSPACE-complete)». Acta Informatica 15 (2): 167-191. S2CID 9125259. doi:10.1007/bf00288964.
Shannon, C. (1953). «Computers and Automata». Proceedings of the Institute of Radio Engineers 41 (10): 1234-41. S2CID 51666906. doi:10.1109/jrproc.1953.274273.

web.archive.org

Nash, John (feb. de 1952). Rand Corp. informe técnico D-1164: Some Games and Machines for Playing Them. https://www.rand.org/content/dam/rand/pubs/documents/2015/D1164.pdf Archivado el 21 de enero de 2017 en Wayback Machine.