next up previous contents
Next: Sitios Web Up: Bibliografía Previous: Libros de Ajedrez y   Índice General

Papers y Publicaciones

22 "Advances in Computer Chess",
vol. 1 M.R.B. Clarke, ed.,
Edinburgh University Press, Edinburgh, 1977

23 "Advances in Computer Chess",
vol. 2 M.R.B. Clarke, ed.,
Edinburgh University Press, Edinburgh, 1980

24 "Advances in Computer Chess",
vol. 3 M.R.B. Clarke, ed.,
Edinburgh University Press, Edinburgh, 1982

25 "Advances in Computer Chess",
vol. 4 D.F. Beal,ed.
Pergamon Press, Oxford, England. 1982

26 "Advances in Computer Chess",
vol. 5 D.F. Beal,ed.,
Pergamon Press, Oxford, England. 1989

27 "`Advances in Computer Chess",
vol. 6 D.F. Beal,ed.,
Pergamon Press, Oxford, England. 1991

28 Aldeson-Velsky, Arlazarov, Bitman y Zhivotovsky,
"Programming a computer to play chess",
Russian Math Surveys, vol 25 1970.

29 Arlazarov & Futre,
"Computer analisis of a rook endgame",
Machine Intelligence 9, University of Edinburgh, 1978.

30 Anantharaman, Campbell y Hsu,
"Singular Extensions:Adding selectivity to brute force searching".
ICCA Journal, Vol. 11, No. 4, pp.135-143, 1988.

31 Anantharaman, Campbell y Hsu,
"Evaluation Tuning for Computer Chess: Linear Discriminant Methods".
ICCA Journal, Vol 20, No 4 , Diciembre de 1997.

32 Beal, D.,
"A Generalized Quiescence Search Algorithm",
Artificial Intelligence, Vol 43, pp. 85-98, 1990.

33 Berliner, H.J.
"Chess as Problem Solving: the Development of a Tactics Analyzer",
Ph.D. Thesis. Pittsburgh: Carniege-Mellon University, 1974.

34 Berliner, H.J.
"The B*-Tree Search Algorithm - A best first proof procedure",
Artificial Intelligence, Vol 12, No 1 pp 23-40, 1979.

35 Berliner, H.J.
"Computer chess at Carnegie Melon University",
Advances in Computer Chess 4, 1986.

36 Berliner, H. y Ebeling C.
"The SUPREM architecture: a new intelligent paradigm",
Artificial Intelligence, 1986.

37 Bernstein, De Roberts
"A chess planning program for the IBM 704",
Western Join Computer Conference, 1958.

38 Boulé, M., Zilic, Z.,
"An FPGA Based Move Generator for the Game of Chess",
Universidad de McGill, Montreal, Canadá, 2002.

39 Bratko L & Kopec D .,
"A test for comparision of human and computer performance in chess",
Advances in Computer Chess 3, 1982.

40 Chase W. , Simon H.,
"The mind`s eye in chess",
Visual Information Processing, New York Academic Press 1973.

41 Campbell, Hoane y Hsu,
"Deep Blue",
Artificial Intelligence N 134, p 57-83, 2002.

42 Condon & Thompson,
"BELLE chess hardware",
Advances in Computer Chess 3, 1982.

43 Condon & Thompson,
"BELLE",
Chess skills in Man and Machine, 1983.

44 Goetsch, G., Campbell, M.,
"Experimenting with the Null-Move Heuristic",
Computers, Chess and Cognition (eds. Marsland and Schaeffer) pp. 158-168, 1990.

45 Gillogly, J.J.
"The Technology Chess Program",
Artificial Intelligence, Vol 3, 1972.

46 Greenblatt R.
"The Greenblatt chess program",
Proceedings of the Fall Joint Computing Conference, pp. 801-810, San Francisco 1967.

47 Heinz, Ernst,
"DarkThought Plays Chess",
Institute for Program Structure and Data Organization, Universidad de Karlsruhe, 1997.

48 Heinz, Ernst,
"DarkThought goes Deep",
Institute for Program Structure and Data Organization, Universidad de Karlsruhe, 1998.

49 Heinz, Ernst,
"Scalable Search in Computer Chess",
Tesis de Ph.D., Universidad de Karlsruhe, Alemania, 1999.

50 Hyatt, R.M.,
"Using time wisely",
ICCA Journal vol 7 no 1 1984.

51 Hyatt R.M., Gower & Nelson,
"CRAY BLITZ",
Advances in Computer Chess 4, 1985.

52 Kendall, G., Whitwell, G.,
"An Evolutioanry Approach for the Tuning of a Chess Evaluation Function using Population Dynamics",
Proceedings of the 2001 IEEE Congress on Evolutionary Computation, Seul 2001.

53 Kister J. Stein, P.,
"Experiments in chess",
J.Assoc Comput Match, vol 4 1957.

54 Knuth D, Moore R.
"An analisis of alpha-beta pruning",
Artificial Intelligencem col 6, 1975.

55 Kotok A.
"A Chess planning program for the IBM 7090",
AI Proyect 1962.

56 Marsland, T.A.,
"Parallel game-tree search",
IEEE 1985.

57 Marsland, T.A., Reinefeld A.,
"Low Overhead Alternatives to SSS*",
Artificial Intelligence, Vol 31, pp. 185-199, 1987.

58 T.A. Marsland y Y. Björnsson,
"Variable Depth Search",
Advances in Computer Games, University of Maastricht p. 5-20, 2000.

59 Michie D.,
"Brute force search in chess and science",
ICCA Journal vol 12 no 3, 1989.

60 Michie D & Bratko
"Ideas in knowledge syntesis stemming from the KBBKN endgame",
ICCAA journal vol 8 no 1, 1985.

61 Mysliwietz, P.
"Konstrucktion und Optimierinung von Bewertungsfunktionem beim Schach",
Disertation (PhD. Thesis) Universidad de Paderborn, 1994.

62 Nelson H.L.
"Hash tables in CRAY BLITZ",
ICCA Journal vol 8 no 1, 1985.

63 Newborn M.
"A parallel search chess program",
Proc of 1985 ACM Annual Conf. 1985.

64 Newborn M.
"A hypotesis concerning the strengh of chess programs",
ICCA Journal, vol 8 no 4, 1986.

65 Newell, Shaw & Simon,
"Chess planning programs and the problem complexity",
IBM Journal if research Development vol 4 no 2, 1958.

66 Rivest, Ronald,
"Game Tree Searching by Min/Max Approximation",
Artificial Inteligence vol 34 no 1 p 77-96, 1987

67 Schaeffer, J.,
"The Historic Heuristic",
ICCA Journal, Vol 6, No 3 pp.16-19, 1983.

68 Shannon, Claude E,
"Programming a computer for playing chess",1950

69 Slate D.J.,
"CHESS 4.5 - The Northwestern University Chess Program",
Chess Skills in Man and Machine, 1977.

70 Thompson K.,
"Computer chess strength",
Advances in computer chess 3, 1982.

71 Thompson, K.
Retrograde Analysis of Certain Endgames.
ICCA Journal,Vol. 9, No. 3, pp. 131-139, 1986.



next up previous contents
Next: Sitios Web Up: Bibliografía Previous: Libros de Ajedrez y   Índice General
Santiago de Chile, Julio 2003