Murray State University · Part one · What AI is

Types of AI

Murray State University
Demo 1 of 17 · Part one · Stage 1

Symbolic AI (GOFAI)

Can a program play well without ever learning?

Before you start. A model is the thing that turns a board into a move. This stage’s model is a rule list: eight yes/no tests a person wrote, checked from the top, and the first test that matches decides the move. Nothing in it changes when it plays.

Predict

With only the First 2 rules switched on, will you be able to beat it?

Try

Press First 2 rules above the rule list and play a game; then press All 8 rules and play again. After each reply the board names the rule that answered you.

Takeaway

This opponent’s skill came from a person: changing its rules changes its play, and playing more games changes nothing.

Live the opponent computes each reply here, now

Show move scores prints the value the opponent has learned or predicted for every empty square, so you see its priorities rather than guess them. Not available in 1a: a rule list has no scores.

Check yourself

The All 8 ladder has no losing line. Where did that skill come from?

Demo 1 of 17 · Part one · Stage 2

Value table

Can experience alone teach a blank table to play?

Before you start. Stage 1a’s model never changed. This model is a value table: one stored number per board position, every one of them zero to begin with. Reinforcement learning nudges those numbers after each win, loss and draw the table plays in training. No person tells it which square is good; only the app’s training burst updates it.

Predict

After one burst of 5,000 training games, will Era 1 be unbeatable, or still beatable?

Try

Press Show move scores in Era 0 (every score reads 0.00), then press Train the AI. Compare Era 1 with Era 0 in the change report under the training controls, and keep training until the proof line appears.

Takeaway

Reinforcement learning stores experience as a separate score for each position; only an exhaustive search over every game line, not a good record, earns the word unbeatable.

Check yourself

Does playing the AI above train it?

Demo 1 of 17 · Part one · Stage 3

Neural Network

Can one set of shared weights score boards it never practised on?

Before you start. Stage 1b’s table kept a separate number for every position. A neural network keeps a smaller set of weights shared across every position and computes a score from them. Here it learns by supervised learning: it fits frozen scores that a fresh 1b table produced, so its targets came from another model, not from a person.

Predict

After training, will the network’s error on held-out positions (kept out of training) be about the same as on the positions it practised, or clearly higher?

Try

Press Create learning examples, read one weight in the network view, then press Train network. Compare the two error readings, then the separate playing score. Optional: switch the board to Ultimate tic-tac-toe for a learner whose inputs leave out part of the game.

Takeaway

Shared weights give the network an answer for a board it never practised on — which a table simply cannot do — and training on other boards makes that answer better. The error readings say how close the answer is to the teacher’s, not how well it plays.

Check yourself

Why does a low held-out error not prove the network plays unbeatable tic-tac-toe?

Check yourself

Which model stores a separate value per position, and which shares weights?

Demo 1 of 17 · Part one · Stage 4

Other architectures & training methods

What else can a model be, and how else can it learn?

Before you start. Stages 1a–1c showed three architectures, meaning how a model is built: a rule list, a table, a network. A training method is a separate choice: how the model’s adjustable parts change, and each of 1a–1c used one or none: press a card below to see which. Both axes have more members than one board can run, and some systems change what they do without changing their parameters at all.

Try

Under Training methods, press a card: the playable models that used it light up beneath it. Switch to Other architectures and press a card: it says what that model stores and what it computes. Switch to Learning with no weight change and press a card: it says whether anything in this demo does it.

Takeaway

Architecture (how a model is built) and training method (how it learns) are separate choices: the same architecture can be trained more than one way, and the same method can train more than one architecture.

Reasoneddefinitions in the authors’ words; the 1a–1c mapping a press reveals is read from this demo’s code; each “used for” line is Sourced (Details)

Training methods — how a model’s adjustable parts change

Press a card. The categories overlap, and one system can combine them.

Self-play is not self-supervised learning. The value table can play against itself, but it still learns from game rewards, so its method is reinforcement learning.

Gradient training is not evolution. Backpropagation computes how prediction error changes with each weight; the update rule uses those derivatives to adjust the current network. Evolutionary optimization instead evaluates variations across a population of candidates.

Check yourself

1c was fitted by supervised learning. Does that make “neural network” a training method?

Demo 1 of 17 · Part one · Stage 5

Model types

If “type” means the job, what goes in and what comes out?

Before you start. Outside this demo, people mostly sort models by type, meaning the job: text in, image out; speech in, text out. Hugging Face, the largest public catalogue of models, sorts its whole hub by exactly these jobs. A type says nothing about the architecture inside: a text-generation model and an image-to-text model can share one architecture family.

Try

Press any type card to read what goes in and what comes out in Hugging Face’s own words, then follow Browse models to see real models of that type. Then read Beyond one catalogue for major types that list does not show.

Takeaway

A model type names the job — what goes in and what comes out — not the architecture inside. One neural-network family, the transformer, serves text, vision, audio, video and multimodal types; generating images, audio and video also leans on a different family, diffusion models, which Hugging Face keeps in a library of its own.

SourcedHugging Face task catalogue, fetched 2026-09-16

Twelve types you will meet first

Each card names the job, then what goes in and what comes out. Press one for the catalogue’s own definition and a link to real models of that type. Model counts are the catalogue’s on the fetch date and will have moved.

Sourcedeach model’s own page, fetched 2026-09-16

Beyond one catalogue

The list above is one platform’s catalogue of what people upload to it. Several of the most talked-about models are not on it, or are not filed under one of its tasks. Each card below names the job, then one real example, linked to that model’s own page.

Sourcedevery task the catalogue lists, in its own groups and order

The whole catalogue

Check yourself

Two models are both transformers. Are they the same type?

Guidehow to use this demo

Where does an AI’s skill come from? Three models play the same tic-tac-toe board, and each got its skill a different way.

Demo 1 of 17 opens Part one. Nothing comes before it. It hands forward one idea to Demo 2 (How a Language Model Works): a model is a representation that can be trained, and architecture, training method and model type are three separate questions to ask of any AI.

  1. 1a Symbolic AI (GOFAI). Press First 2 rules, play, then All 8 rules. The board names the rule that answered you.
  2. 1b Value table. Press Show move scores in Era 0, then Train the AI and compare eras in the change report.
  3. 1c Neural Network. Press Create learning examples, then Train network; read the two error readings and the playing score.
  4. 1d Other architectures & training methods. Press a training method card to see which playable model used it.
  5. Model types. Switch the top lens to Model types; press a type card and follow Browse models.

Getting around

The top lens switches between Model architecture and Model types; the stage tabs switch stages within a lens. Details opens the evidence and limits for the current stage. Guide reopens this card; Settings has Open Presenter Notes, Presentation mode and Reset, plus a rehearsal seed and the self-test.

Time

About 20 minutes. Each training burst is paced to a few seconds; the neural stage’s preparation is the one slow step.

Settings

Presenter notes

The printable 20-minute session plan, on screen.

Presentation mode

Scales the page up one notch for projecting to a room, and puts a Notes button in the header.

Reset

Back to the start: stage 1a on the Model architecture lens, First 2 rules, move scores hidden, every era and network discarded so the table is Era 0 again, your records cleared, every prediction and check cleared, every type card closed. Presentation mode and your playing preference stay as you set them.

Playing

Rehearsal seed

Type a seed and press Reset: training then unfolds identically every time, so a rehearsal matches the lesson. Blank means different every time.

Verification

Checks the selected stage. For 1a and 1b it searches every game line against the displayed policy and runs sampled games. For 1c it reports the network’s prediction errors, the policy check and sampled play separately. The optional Ultimate extension uses sampled benchmarks and a state-space upper bound; the app does not exhaustively verify its policy. Results appear here and in the browser console.

About

DetailsSymbolic AI (GOFAI)

What is live

Everything on this stage is computed here

Live the board and the rule commentary

Each reply is chosen by running the ladder on the current board, and the rule that fired is the one the commentary names.

Live the proof line

The exhaustive search below runs on this device against the ladder as switched on; it is re-run from Settings → Run the full self-test.

How it works

Good Old-Fashioned Artificial Intelligence, or GOFAI, is a historical name for the symbolic AI tradition: programs that work with human-defined symbols, relationships and rules. This demo’s short hand-written priority list is one simple example, not the whole tradition.

The ordered list acts like a chain of decision tests. If a test answers yes, it selects that action; if no, the program continues to the next test. A person wrote every test and its priority, so playing games does not revise this policy.

Symbolic does not mean unlearned. Decision trees also route examples through tests, but their questions and branches can be learned from data. The representation and the way it was produced are separate facts: this particular chain was written by a person.

Assumptions and simplifications

  • Eight rules stand in for a tradition that built expert systems with thousands; the point is the mechanism, not the scale.
  • When no rule applies the opponent picks a free square at random, so a shortened ladder’s exact losing game recurs by chance, not by design.
  • The exhaustive search follows every reachable reply including tied choices; it proves a property of this small game only.

Sources

  • The ladder is src/rules.js; the search is OG.verifyPolicy in src/engine.js. Both ship inside this file and run in Settings → Run the full self-test.
Boundary: a symbolic policy can be unbeatable on a small game. This demo does not claim that symbolic systems are always best, that they never scale, or that later models inevitably replace them.

Presenter Notesthe printable guide, on screen

Murray State University · Presenter guide

Types of AI

Demo 1 of 17 · Part one · What AI is · 20 minutes

You need: one browser and the demo’s index.html; it works offline. Start from a fresh page or press Settings → Reset. Settings → Presentation mode scales the page for a projector; Open Presenter Notes shows this guide in the app.

Learning goals

Each stage’s Takeaway, as the learner reads it:

  1. 1a. This opponent’s skill came from a person: changing its rules changes its play, and playing more games changes nothing.
  2. 1b. Reinforcement learning stores experience as a separate score for each position; only an exhaustive search over every game line, not a good record, earns the word unbeatable.
  3. 1c. Shared weights give the network an answer for a board it never practised on — which a table cannot do — and training on other boards makes that answer better. The error readings say how close the answer is to the teacher’s, not how well it plays.
  4. 1d. Architecture (how a model is built) and training method (how it learns) are separate choices: the same architecture can be trained more than one way, and the same method can train more than one architecture.
  5. Model types. A model type names the job — what goes in and what comes out — not the architecture inside. One neural-network family, the transformer, serves text, vision, audio, video and multimodal types; generating images, audio and video also leans on a different family, diffusion models, which Hugging Face keeps in a library of its own.

Where this sits on the path

Demo 1 of 17 opens Part one. Nothing comes before it. It hands forward one idea to Demo 2 (How a Language Model Works): a model is a representation that can be trained, and architecture, training method and model type are three separate questions to ask of any AI.

One question for the session

Where does an AI’s skill come from? Three models play the same board and each got its skill a different way. The top lens sorts models two ways: Model architecture (how it is built and trained — 1a to 1d) and Model types (what it does).

“Architecture is how it is built. Training method is how it learns. Type is the job. Keep asking which one someone means.”

1a · Symbolic AI (GOFAI) — 4 minutes

Question

Can a program play well without ever learning?

Predict prompt

Ask the room to press a prediction: with only the First 2 rules on, can you beat it? Take a show of hands before anyone plays.

Activity

  1. 0:00 Press First 2 rules. Play one game; invite the room to find the fork. The Notice line and the panel name the rule that answered each move.
  2. 1:30 Press All 8 rules and play again. Point at the rule that fires each turn.
  3. 3:00 Open Details: the proof line reports the exhaustive search over every game playable against the ladder.

Expected observation

Two rules lose to a fork; eight rules have no losing line. The opponent explains every move by naming a rule, and nothing about it changes however many games are played.

Check answer: a person wrote every rule and its priority; playing did not change them. The wrong option (“it learned the rules by playing”) is refuted by First 2 losing the same fork forever.

Teaching limit

GOFAI means Good Old-Fashioned Artificial Intelligence. This decision list can be drawn as a tree; here people wrote the tests, whereas decision trees can also be learned. Say “this small example”, not “symbolic AI”.

1b · Value table — 5 minutes

Question

Can experience alone teach a blank table to play?

Predict prompt

After one burst of 5,000 games, will Era 1 be unbeatable or still beatable? Press a prediction.

Activity

  1. 0:00 In Era 0 press Show move scores: every square reads 0.00. Play one short game; it moves at random.
  2. 1:00 Press Train the AI. Read the change report under the training controls: recorded scores before and after the burst.
  3. 2:30 Train again until the Notice line says verified unbeatable (usually burst 3 to 5). Switch the Opponent era back to Era 0 and forward again: the report follows the selection.
  4. 4:00 Open Details for the proof line.

Expected observation

Era 1 is still beatable; the scores moved but a losing line remains. A later era has no losing line in either role. Human play never changes the table; only the burst does.

Check answer (“Does playing the AI above train it?”): no — here only the training burst updates the table; your games are scored, not learned from. Say the caveat out loud: that is this demo’s choice, not a law. The same table could have learned from every game you played, and real assistants can use what people type to train later versions, usually behind a setting. Details cites two vendors’ own pages (fetched 2026-09-16).

Teaching limit

A prediction of “unbeatable” is a claim about the table, settled by the exhaustive search, not by whether the room beat it: losing to a beatable era looks exactly like losing to an unbeatable one, and the reveal line says which one the search found. The table has one separate score per position, so it carries nothing to a different situation. Tic-tac-toe is small enough to tabulate; chess and language are not, which is why the next stage shares parameters.

1c · Neural Network — 6 minutes

Question

Can one set of shared weights score boards it never practised on?

Predict prompt

After training, will held-out error be about the same as practised error, or clearly higher? Press a prediction; the reveal quotes the measured numbers.

Activity

  1. 0:00 Press Create learning examples. A fresh table learner plays 20,000 seeded games; its estimates freeze as targets. This is the one slow step.
  2. 1:30 In the network view, pick a connection layer and a neuron; read one weight and its initialized value.
  3. 2:30 Press Train network. Compare the weight with its initial value, then the practised and held-out errors, then the separate playing score. Show move scores shows predictions for legal moves.
  4. 5:00 Optional: press Ultimate tic-tac-toe above the board to show a representation that cannot see the whole game; Standard board brings the network back.

Expected observation

The network is a feedforward multilayer perceptron (29 inputs, 28 and 18 ReLU units, one output) fitted by supervised learning to targets another model produced. Backpropagation supplies gradients; updates are normalized gradient steps. Shared weights give an answer for a held-out position; the error readings say how close, and neither is playing strength.

Check answers: error measures agreement with the frozen table’s scores, which are themselves estimates; play is measured separately. 1b stores one number per position; 1c reuses 1,381 shared parameters for every board.

Teaching limit

Lower error means closer agreement with the teacher, not guaranteed playing strength; no automatic unbeatable claim is made. A position the fresh teacher never visited stays at zero — a limit of the examples, not proof the position is neutral. During play the network calculates its own scores without consulting the frozen table. Activations are responses to a board, not stored weights; a positive weight is not a good move.

1d · Other architectures & training methods — 3 minutes

Question

What else can a model be, and how else can it learn?

Predict prompt

None on this stage. 1d is a map, not an experiment; nothing on it runs a result a prediction could be checked against. If you want a show of hands anyway, ask which of 1a, 1b, 1c learned from inputs paired with target answers, then press the Supervised learning card.

Activity

  1. 0:00 The stage has three parts behind three buttons. Under Training methods, press each card. The card faces do not say which model used them; the press does: supervised → 1c, reinforcement → 1b, no training → 1a; the other three light nothing. Point at the one-line “used for” notes: pretraining is self-supervised, fine-tuning and distillation are supervised, RLHF is reinforcement — stages, not extra methods.
  2. 1:30 Switch to Other architectures and press a card: the line beneath says what that model stores and what it computes — linear models, decision trees, ensembles, nearest neighbours, support-vector machines, probabilistic models. Search and planning are named separately as problem-solving approaches.
  3. 2:15 Switch to Learning with no weight change: in-context learning, retrieval, search at decision time. Tie it to 1b’s check: a model can appear to learn in a session without changing. Press Search at decision time: 1a’s fork rules look one move ahead every turn; the demo’s exhaustive search checks players and never picks a move.

Expected observation

Architecture and training method are separate columns. 1c is a network trained by supervised learning; a network could equally be trained by reinforcement, and a table could be fitted to supervised targets.

Check answer: no — the network is an architecture; supervised learning is how this one was trained.

Teaching limit

The cards are textbook categories, not a complete catalogue, and real systems combine them. Self-play is not self-supervision: 1b learns from rewards. Gradient training is not evolution.

Model types — 3 minutes

Question

If “type” means the job, what goes in and what comes out?

Predict prompt

None on this stage: it is informational, and nothing on it runs a result a prediction could be checked against.

Activity

  1. 0:00 Switch the top lens to Model types. Press three cards the room will recognise: text generation, text-to-speech, speech-to-text (automatic speech recognition). Each shows what goes in and comes out, then the catalogue’s own definition.
  2. 1:30 Press Image-to-3D: the job people call image-to-mesh. Follow Browse models on one card if you are online; the demo itself never fetches.
  3. 2:00 Scroll to Beyond one catalogue: eight major types the Hub list does not show — world models (Genie 3), video with sound (Veo 3.1), robot control (Gemini Robotics), protein structure (AlphaFold), weather (GenCast), background removal (NVIDIA Broadcast), character animation, free-viewpoint video — each linked to the model’s own page.
  4. 2:30 Scroll to the whole catalogue: every type Hugging Face lists, in its groups, with the model count on the fetch date.

Expected observation

A type is named by its input and output. Text generation and image-to-text are different types that can share one architecture family; tabular types are the visible exception, where the catalogue names tree and boosting libraries. The link back to 1c: a small network scoring boards is the same idea as the networks behind most of these types.

Check answer: not necessarily — type is the job; one transformer may generate text and another caption images.

Teaching limit

The taxonomy and the counts are Hugging Face’s, fetched on the date shown on the stage; counts move daily. Other catalogues cut the jobs differently. The stage does not run any of these models.

Misconceptions

“A program that plays well must have learned.”1a plays unbeatable tic-tac-toe with no learning at all. Skill can be written down by a person; learning is one way to get it, not the definition of AI.
“A long run of draws proves it is unbeatable.”Sampled games can miss a line. The app calls an era unbeatable only after searching every reachable game line in both roles. Open Details for the counts.
“Playing against the table trains it.”Not here: human play is scored, not learned from, and every era is a frozen copy. But it is a design choice, not a rule — real systems can and sometimes do train on what users type.
“I lost, so it must be unbeatable.”Beatable means a losing line exists, not that you found it. The search settles the verdict; your record only says how you played.
“Low error means it plays well.”Error is agreement with a teacher whose estimates are imperfect. The playing score is a separate, fixed-seed measurement, and this tab never claims unbeatable.
“Neural network is a kind of learning.”It is an architecture. 1c’s network was fitted by supervised learning; the same weights could be trained by reinforcement. Press the method cards in 1d.
“Same architecture, same type.”Type is the job. Hugging Face files transformers under text generation, image-to-text, speech recognition and more. Ask what goes in and what comes out.

Discussion questions

  • Which model stores separate values, and which shares weights? What does each choice make easy and hard?
  • Why does lower held-out error not prove unbeatable play? What measurement would?
  • Name an AI product you use. Which type is it, what might its architecture be, and how do you think it was trained? Which of the three can you actually tell from the outside?
  • The Ultimate extension: what information does the inherited representation leave out, and why can more training not put it back?

Presenter controls

  • Guide (header) reopens the learner card. Settings has Open Presenter Notes, Presentation mode and Reset, then a playing preference, a rehearsal seed, the self-test and About.
  • Reset is in place: stage 1a, First 2 rules, move scores hidden, Era 0, records and predictions cleared, type cards closed. Presentation mode and the playing preference stay.
  • Rehearsal seed: type a seed and press Reset; training then unfolds identically, so a rehearsal matches the lesson.
  • Run the full self-test re-runs the exhaustive search on the selected stage and prints it in Settings and the console.
  • Deep links: #stage-1 to #stage-5; the older #rules, #learning, #neural still work.
Bryant Harrison · Murray State University · Types of AI · single-file offline demo · no accounts or runtime network requests · the Model types stage links out to huggingface.co, fetched 2026-09-16

Open the printable copy (demo-guide.html) — the same document, laid out for print; the PDF beside it is a render of that file.

What it learned

Bryant Harrison · Murray State University