Abstract
One of the most important fields of research in computer science is the investigation of intelligent agents for the web which should search in the net for informations. Usually these agents are cooperating and form a working group of “multi agents”. But these groups or different agents can also stay in competition to each other. In both cases we have to model the behavior of the agents; i. e. to program a set of rules (consisting of preconditions and actions) which tells every agent what he has to do.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Banerji, R.: Artificial Intelligence: A Theoretical Approach. North-Holland Publ. Comp., Amsterdam (1980)
Bell, A.G.: Games Playing with Computers. George Allen & Unwin, London (1972)
Berlecamp, E., Conway, J., Guy, A.: Winning Ways (for your mathematical plays), vol. 1 + 2. Academic Press, London (1982)
Buneman, P., Levy, L.: The Towers of Hanoi Problem. Information Proceeding Letters 10, 243–244 (1980)
Butter, S., Payer, K., Pokorny, L., Schimanovich, W.: Minimühle. Konstruktion eines optimalen Spieles für die Zieh- und Sprungphase. Technical Report of the Institute of Statistics and Computer Science, University Vienna (1981)
Casti, J.: Searching for Certainty. What Scientists Can Know About the Future. William Morrow & Comp., N.Y (1990)
Casti, J., DePauli, W.: Kurt Gödel. A mathematical Legend. Perseus Books, Reading (2000)
Cull, P., Ecklund, E.: Towers of Hanoi and Analysis of Algorithms. American Mathematical Monthly 92(6) (June-July 1985)
De Pauli-Schimanovich, W.: Programming Chess & Computer Games (Part I + II). In: Wiener’s Cybernetics: 50 years of evolution. Cybernetics 1999, Extended Abstracts (1999) ISBN-84-8416-950-2
De Pauli-Schimanovich, W.: The Calculus of Winning. In: Yearbook 1999 of the Kurt Gödel Society, TU-Vienna (2000)
Feda, M., Bartl, R.: Pente: 5er-Reihe mit 5-Pärchen-Klau. Technical Report of the Institute of Statistics and Computer Science, University Vienna (1985)
Grob, K.: Ein Automatischer Spieler für Master Mind. Diploma Thesis at the Institute of Statistics and Computer Science, University of Vienna (1978)
Hartmann, G.: Konstruktion der Optimierungsstrategie und Programmierung eines automatischen Spielers für das L-Spiel von Edward de Bono. Diploma Thesis at the Institute for Statistics and Informatics, University of Vienna (1980)
Horacek, H.: Ein Modell des menschlichen Problemlösens an Hand von Schach-Bauern- Endspielen. Dissertation at the Institute for Logistic, University of Vienna (1982)
Jauernik, R.: Entwurf eines heuristischen Spielers für das BEAR-DOG-HUNT-Spiel. Diploma Thesis at the Institute for Statistics and Informatics, University of Vienna (1990)
Kaindl, H., Schimanovich, W.: Catrin, mathematisches Brettspiel für 2 Partner. In: Technical Report Nr.7 at the Institute of Statistics and Computer Science, University of Vienna (1978)
Kaindl, H.: Neue Wege im Computerschach. Dissertation at the Institute for Information Systems, Technical University Vienna (1983)
Laufer, H., Schimanovich, W.: Peggy: Arbeitsweise eines Optimalen Dialogspieles. Technical Report of the Institute of Statistics and Computer Science, University Vienna (1981)
Laufer, H.: SOLITAIRE. Arbeitsweise eines optimalen Dialogspielers. Diploma Thesis at the Institute for Statistics and Informatics, University of Vienna (1982)
Levi, L.: Computer Games. Springer, Heidelberg (1980)
von Neumann, J.: Theorie der Gesellschafts-Spiele. Mathematische Annalen 100 (1928)
von Neumann, J., Morgenstern, O.: Game Theory and Economic Behavior. Princeton University Press, Princeton (1944)
Nielsson, N.: Problem Solving Methods in AI. McGraw-Hill Book Comp., N.Y. (1971)
Nielsson, N.: Principles of AI. Tjoga Publ.Press/Springer Inc., N.Y (1980)
Österreicher, K., Sulzgruber, D., Schimanovich, W.: Tertio en Raya. Konstruktion eines optimalen Spielers. Technical Report of the Institute for Statistics and Computer Science, University of Vienna (1980)
Payer, W.: Ein Optimaler Spieler für die Ovalmühle. Klassifikation der Stellungen und Konstruktion eines optimalen Dialogspielers. Diploma Thesis at the Institute for Statistics and Informatics, University of Vienna (1983)
Pearl, J.: Search and Heuristics. North-Holland Publ. Comp., Amsterdam (1983)
Pearl, J.: Heuristics. Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publ. Comp., Reading (1984)
Schimanovich, W.: Der Gewinnkalkül. In: Abstract für den Workshop, Berichte aus Informatik-Instituten (September 1978)
Schimanovich, W.: Prädikatenlogische Theorie zur Behandlung von Positionsspielen. In: Proceedings of the 4th International Wittgenstein Symposium 1979, Hölder-Pichler- Tempsky-Verlag, Vienna (1980)
Schimanovich, W.: Spiele und Intelligenz. In: Wissenschaft Aktuell, Heft 3 (Juni) und Heft 4 (September), Wien (1980)
Schimanovich, W.: An Axiomatic Theory of Winning Mathematical Games. Cybernetics and Systems 12, 1–19 (1981)
Schimanovich, W.: An Axiomatic Theory of Winning Mathematical Games and Economic Actions. In: Proceedings of the 5th European Meeting on Cybernetics and System Research 1980. Hemisphere Publishing Corp., N.Y. (1982)
Schimanovich, W.: Relative Problem Solving and the Role of Logic in AI (Invited Lecture of AIMSA, Varna.) Technical Report of the Institute for Statistics and Computer Science, University of Vienna (1984)
Shannon, C.: Programming a Computer for Playing Chess. Phil. Magazine, Band 41, pp. 256–275 (1950)
Slagle, J.: Artificial Intelligence: The Heuristic Programming Approach. McGraw-Hill Book Comp., London (1971)
Slany, W.: Hexi: Happy Perfect Hexagon Player. Technical Report of the Institute for Statistics and Computer Science, University of Vienna (1984)
Thompson, K.: Retrograde Analysis of Certain Endgames. ICCA Journal (September 1986)
Trubel, F., Schibl, A.: Rock em up: Beschreibung des automatischen Spielers und des Programmes samt Lösungs- Algorithmus. Technical Report of the Institute for Statistics and Computer Science, University of Vienna (1982)
Wagner, M., Schimanovich, W.: Laufzeituntersuchung und Optimierung des Schachprogrammes Chess.5. Technical Report of the Institute for Statistics and Computer Science, University of Vienna (1980)
Wiesbauer, W.: Kalah4: Ein optimaler Dialog-Spieler. Diploma Thesis at the Institute for Statistics and Informatics, University of Vienna (1981)
Wiener, N.: Cybernetics. John Wiley, N.Y. (1948)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
DePauli-Schimanovich-Göttig, W. (2000). Automatic Players for Computer Games. In: Kopacek, P., Moreno-Díaz, R., Pichler, F. (eds) Computer Aided Systems Theory - EUROCAST’99. EUROCAST 1999. Lecture Notes in Computer Science, vol 1798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720123_52
Download citation
DOI: https://doi.org/10.1007/10720123_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67822-9
Online ISBN: 978-3-540-44931-7
eBook Packages: Springer Book Archive