Special offer. See more information about Outbyte and uninstall instructions. Please review EULA and Privacy policy.

Some links on this page are affiliate links: if you buy through them we may earn a commission, at no extra cost to you.

There is no single, universally agreed oldest AI. If AI means a working computer program that learned while performing an intelligent task, Arthur Samuel’s checkers program, begun in 1952, is a leading candidate. If the question is when artificial intelligence became a named academic field, the conventional answer is 1956, the year of the Dartmouth Summer Research Project on Artificial Intelligence.

The difference matters: ancient stories imagined artificial beings, 1940s researchers developed computational theories, and early programs explored tasks such as game playing and theorem proving. Those are related milestones, not interchangeable answers.

Why there is no one answer to “the oldest AI”

“AI” can refer to several different things: an idea of an artificial being, a machine that operates automatically, a mathematical model of computation, a program that performs a task associated with intelligence, or the research field that studies such systems. Each definition points to a different milestone.

Special offer. See more information about Outbyte and uninstall instructions. Please review EULA and Privacy policy.

Automation is not automatically intelligence. A device can operate without constant human intervention while following a fixed mechanism. Conversely, a program can perform a narrow reasoning task without being a physical robot or having anything like human-level general intelligence.

For a practical answer, Samuel’s checkers program is a strong candidate because it played a strategic game and improved through experience. The Logic Theorist, developed in the mid-1950s, is another landmark: it used search to prove mathematical theorems. The year 1956 is best understood as the conventional beginning of AI as a named field, not necessarily the date of the first AI program.

Artificial beings are ancient; computational AI is modern

Long before computers, people imagined artificial servants and autonomous creatures. Greek mythology, for example, includes Hephaestus’s artificial servants and Talos. Later inventors built automata designed to imitate animal or human movements. Ancient self-regulating mechanisms, including water clocks, also show that automatic behavior has a long history.

These are important precursors in the history of artificial beings and automation, but they are not AI systems in the modern computational sense. They did not learn from data, search through representations of possible actions, or manipulate symbols using a general-purpose program. Calling AI “thousands of years old” blurs the difference between imagining an artificial agent and engineering a system that computes.

Special offer. See more information about Outbyte and uninstall instructions. Please review EULA and Privacy policy.

1943: a theoretical foundation for neural computing

In 1943, Warren McCulloch and Walter Pitts published “A Logical Calculus of the Ideas Immanent in Nervous Activity,” proposing a mathematical model of simplified neurons. Their work became an important foundation for later artificial neural networks. Read the McCulloch–Pitts work.

This was a theoretical model, not a modern trained neural network, chatbot, or autonomous agent. It is more accurate to call it an early foundation of neural computation than to name it the oldest complete AI system.

1952: Arthur Samuel’s checkers program

If “oldest AI” means an early working program that learned from experience while performing a task associated with intelligence, Arthur Samuel’s checkers player is one of the strongest candidates. Samuel began developing it at IBM in 1952. It evaluated possible moves, used search, and could play against itself; its performance could improve as it accumulated experience. It is widely described as an early practical machine-learning program. Learn more about Samuel’s checkers program.

Checkers made a useful research test. The game has clear rules and outcomes, but choosing a move requires considering possible future positions. A program could explore alternatives and use an evaluation function—a way to estimate how favorable a position was—to guide its choices. Self-play provided further experience for refining how positions were assessed.

Free tools Windows power users keep installed

One-click scans. No signup required.

Special offer. See more information about Outbyte and uninstall instructions. Please review EULA and Privacy policy.

“Learning” here does not mean modern deep learning. Samuel’s system relied on hand-designed representations, evaluation methods, and search. It was a specialized program for a particular game, not a general-purpose mind. Its historical importance lies in showing how a computer could improve at a task through experience rather than simply follow a fixed sequence of moves.

The Logic Theorist: an early program for symbolic reasoning

Allen Newell, Herbert A. Simon, and Cliff Shaw developed the Logic Theorist in the mid-1950s. It was designed to prove mathematical theorems by exploring possible proof steps. The program is widely regarded as one of the first landmark AI systems and a major early example of symbolic AI. See the Cambridge University Press discussion of early AI and theorem proving.

Symbolic AI represents information explicitly—as symbols, facts, or rules—and applies procedures to manipulate it. The Logic Theorist’s search through possible proof steps made it a different kind of achievement from Samuel’s game-playing learner. The checkers program is a leading candidate for early learning AI; the Logic Theorist is a leading landmark in early reasoning AI. Which one is “first” depends on what capability the question means.

1956: AI’s conventional birthday as a field

The Dartmouth Summer Research Project on Artificial Intelligence in 1956 is conventionally treated as the beginning of AI as a named academic field. John McCarthy used the term “artificial intelligence” in the project proposal. The gathering helped establish a shared research agenda around machine intelligence. Read the University of New South Wales overview of AI’s history.

Special offer. See more information about Outbyte and uninstall instructions. Please review EULA and Privacy policy.

That date marks the formation of a recognizable discipline, not the first appearance of AI-related ideas or programs. The McCulloch–Pitts model preceded it, as did Samuel’s checkers work and the development of the Logic Theorist.

Independent reader supportYour contribution helps us test, update, and keep practical guides available for everyone.Support on Ko-Fi

From game boards to robots: Shakey and A*

By the late 1960s and early 1970s, AI research was moving beyond abstract games and proofs toward machines that could plan and act in physical surroundings. Shakey, an early autonomous robot developed at Stanford Research Institute, combined perception, planning, navigation, and action.

Search algorithms helped systems explore possible routes or plans. A* (pronounced “A-star”), associated with early robot-planning work, guides a search using both the cost already incurred and an estimate of the remaining distance to a goal. Search is not itself an intelligent entity, and Shakey was not the oldest AI; both illustrate how AI research expanded toward autonomous action. Related pathfinding ideas remain influential. The UNSW history overview discusses Shakey and A*.

Which milestone counts as the oldest?

What “oldest AI” means Best answer Date Why the qualification matters
Earliest imagined artificial being Ancient myths, including Talos and Hephaestus’s artificial servants Antiquity These are fictional or mythological, not engineered AI.
Early automated mechanisms Ancient self-regulating devices, including water clocks Ancient world Automation does not by itself imply intelligence.
Early mathematical model of neuron-like computation McCulloch–Pitts model 1943 A theoretical foundation, not a complete AI program.
Early practical learning AI Arthur Samuel’s checkers program Begun in 1952 A strong candidate for an early program that improved through experience.
Early symbolic reasoning program Logic Theorist Mid-1950s A landmark theorem-proving system, distinct from a learning program.
Beginning of AI as a named academic field Dartmouth Summer Research Project 1956 The conventional field-start date, not necessarily the first AI program.
Early autonomous robot planning Shakey and associated planning work Late 1960s–1970s An important robotics milestone, not the first AI.

What about ELIZA or the oldest AI algorithm still in use?

ELIZA, created in 1966, became a famous early chatbot, but it came after game-playing and theorem-proving programs. Being an early chatbot is not the same as being the first AI overall. Read an overview of ELIZA and AI history.

Special offer. See more information about Outbyte and uninstall instructions. Please review EULA and Privacy policy.

There is no simple, agreed answer to “the oldest AI algorithm still in use.” Search is among the early techniques used in AI, and modern systems continue to use methods descended from older search and pathfinding ideas. But “still in use” might mean a named procedure survives, a modern method descends from it, or original code still runs. Those are different claims; an old idea embedded in a new implementation is not the same as an unchanged 1950s program operating today.

The precise answer

Artificial intelligence has ancient imaginative roots, important computational foundations by 1943, working programs from the early 1950s, and a formal academic identity conventionally dated to 1956. For a single practical answer, Arthur Samuel’s checkers program, begun in 1952, is a leading candidate for the oldest working learning AI. The Logic Theorist is a competing landmark for early symbolic reasoning, while 1956 remains AI’s conventional birthday as a field.

Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on Amazon at the time of purchase will apply.