Gli Scacchi e i Matematici

Paolo Ciancarini

Bollettino dell'Unione Matematica Italiana (1999)

  • Volume: 2-A, Issue: 2, page 203-236
  • ISSN: 0392-4041

Abstract

top
I

How to cite

top

Ciancarini, Paolo. "Gli Scacchi e i Matematici." Bollettino dell'Unione Matematica Italiana 2-A.2 (1999): 203-236. <http://eudml.org/doc/219365>.

@article{Ciancarini1999,
abstract = {},
author = {Ciancarini, Paolo},
journal = {Bollettino dell'Unione Matematica Italiana},
language = {ita},
month = {8},
number = {2},
pages = {203-236},
publisher = {Unione Matematica Italiana},
title = {Gli Scacchi e i Matematici},
url = {http://eudml.org/doc/219365},
volume = {2-A},
year = {1999},
}

TY - JOUR
AU - Ciancarini, Paolo
TI - Gli Scacchi e i Matematici
JO - Bollettino dell'Unione Matematica Italiana
DA - 1999/8//
PB - Unione Matematica Italiana
VL - 2-A
IS - 2
SP - 203
EP - 236
AB -
LA - ita
UR - http://eudml.org/doc/219365
ER -

References

top
  1. ATKINSON, G., Chess and Machine Intuition, Ablex, 1993. 
  2. BINET, A., Psychologie des Grand Calculateurs et Joueurs d’Echecs Hachette, 1894. 
  3. BONSDORFF, E. - FABEL, K. - RIIHIMAA, O., Schach und Zahl, Rau Verlag, 1971. 
  4. BRATKO, I., Prolog Programming for AI, Addison Wesley, 1985. 
  5. CIANCARINI, P., Giocatori artificiali, Mursia1992. 
  6. CIANCARINI, P., Distributed Searches: A Basis for Comparison, Journal of the Intern. Computer Chess Association, 14:4 (1994), 194-206. 
  7. CURZIO, M., Scacchi, Matematici e Matematica, Archimede, Le Monnier, 78:1 (1981), 1-13. 
  8. DOXIADIS, A., Zio Petros e la congettura di Goldbach, Bompiani, 2000. 
  9. GIK, J., Schach + Mathematik, Edizioni MIR, Mosca, 1986. Zbl0661.90098
  10. HARDY, G., Apologia di un matematico, Cambridge Univ. Press, 1940 (ed. it. Garzanti, 1989). 
  11. HODGES, A., A. Turing: the Enigma, Simon & Schuster, 1983 (Ed. It. Boringhieri). Zbl0541.68001MR882917
  12. HSU, F., The chips of Deep Blue, IEEE Micro, March-April, 1999. 
  13. VON JÄNISCH, K., Traité des Applications de l’Analyse Mathematique au Jeu des Echecs, S. Pietroburgo, 1863. 
  14. LARSON, L., A Theorem about Primes proved on a Chessboard, Mathematics Magazine, 50:2(1977), 69-74. Zbl0357.10003MR457387
  15. LASKER, EM., Zur Theorie der Moduln und Ideale, Matematische Annalen, 60:20-116, 1905. MR1511288JFM36.0292.01
  16. LOSANO, M., Storie di Automi, Einaudi1990. 
  17. MCGREW, T., Collaborative Intelligence, IEEE Internet Computing, 1:3 (1997), 38-42. 
  18. MURRAY, H., A History of Chess, Oxford University Press, 1911. 
  19. PETKOVIC, M., Mathematics and Chess, Dover, 1997. MR1474728
  20. ROBISON, A. - HAFNER, B. - SKIENA, S., Eight Pieces Cannot Cover a ChessBoard, Computer Journal, 32:6(1989), 567-570. 
  21. SIMON, H., Models of my Life, Harper Collins, 1991. 
  22. SHAEFFER, J., Experiments in Search and Knowledge, PhD Thesis, Univ. of Alberta, Canada, 1986. 
  23. SHANNON, C., Programming a Computer for Playing Chess, Philosophical Magazine, 41(1950), 256-275 (ristampato in D. Levy, Computer Chess Compendium, Batsford, 1988). Zbl0041.44605MR34095
  24. TURING, A., Digital Computers Applied to Games, in Bowden B. (ed.), Faster than thought: a Symposium on digital computing machines. Pitman1953 (ristampato in D. Levy, Computer Chess Compendium, Batsford, 1988). MR61894
  25. ZERMELO, E., An Application of Set Theory to the Theory of Chess-playing, Proc. 5th Int. Congress of Mathematics, Cambridge, 1912. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.