ExampleGuidancev1.0.0

Chess program using minimax and heuristic evaluation

A software company releases a chess program that assesses board positions using a minimax algorithm with heuristic evaluation functions. The program has never learned from game data; it applies pre-programmed rules and search strategies to find a strong move.

The official source remains authoritative. This is general information about obligations and not legal advice. See this object on the map

Address and citation

This object has an address of its own that is never renamed or reused. Store the identifier in your own file, not the title or the link.

Identifier: praxikon:eu:ai-act:example:example-schaakprogramma-minimax-heuristiek
Payload hash (sha256): ea77388b96fa6332db5b79bba1180f77661ed8b1cec9f73bed38f1cb4fd1b001

Citation line

Praxikon, "Chess program using minimax and heuristic evaluation", praxikon:eu:ai-act:example:example-schaakprogramma-minimax-heuristiek@1.0.0, dataset praxikon:sys:registry:dataset:ai-act-implementation-graph 2.1.0 (schema 1.4.0), effective_at 2026-08-08T00:00:00.000Z, known_at 2026-08-14T00:00:00.000Z, sha256 ea77388b96fa6332db5b79bba1180f77661ed8b1cec9f73bed38f1cb4fd1b001

Version: 1.0.0
Legal time (effective_at): 8 August 2026
Knowledge time (known_at): 8 August 2026
Closed on: Not closed
Topics: examples

Review status: Placed against the official source (8 August 2026). Next check due by 4 February 2027. The check date is the knowledge date of this version; no later recheck has been recorded.

What this object links to

Every relation appears below as a path: from the source with its locator, through the conditions and exceptions of the object carrying the relation, to the consequence. A locator belongs to a statement in the data and not to a relation, so the source is the source anchor of the carrying object.

The obligation this hangs off

1 of 1 shown

The object belongs to this obligation. The source line it hangs off sits there.

Source
Official fact on this object, with its locator.
- Guidelines on the definition of an AI system, C(2025) 5053 final
  Locator: Commission Guidelines C(2025) 5053 final, 29.7.2025, borderline cases under the definition in Article 3(1)
  praxikon:eu:ai-act:source:commission-ai-system-definition-guidelines
  Open official source
Via
No condition or exception recorded on this object.
Consequence
- ObligationArticle 4: AI literacy
  praxikon:eu:ai-act:obligation:article-4-ai-literacy

What this object is about

1 of 1 shown

The object is about this role. Undifferentiated: it does not follow that the duty rests on this role.

Source
Official fact on this object, with its locator.
- Guidelines on the definition of an AI system, C(2025) 5053 final
  Locator: Commission Guidelines C(2025) 5053 final, 29.7.2025, borderline cases under the definition in Article 3(1)
  praxikon:eu:ai-act:source:commission-ai-system-definition-guidelines
  Open official source
Via
No condition or exception recorded on this object.
Consequence
- ActorProvider of an AI system
  praxikon:eu:ai-act:actor:provider

What this object states

Official fact

Attributable to a named primary source, with a locator. Where they differ, the official source prevails.

The Commission guidelines on the definition of an AI system use this case to draw the line between software that does and does not fall under the regulation. The document is non-binding.
- Locator: Commission Guidelines C(2025) 5053 final, 29.7.2025, borderline cases under the definition in Article 3(1)praxikon:eu:ai-act:source:commission-ai-system-definition-guidelinesOpen official source

Our interpretation

Our own reading. It can change without the law changing, and it is not the position of a supervisory authority.

That your system never learned from data does not settle the question, because the guidelines also count logic and knowledge based approaches as AI techniques and do not tie the definition to a chosen technique.
- Locator: Commission Guidelines C(2025) 5053 final, 29.7.2025, borderline cases under the definition in Article 3(1)praxikon:eu:ai-act:source:commission-ai-system-definition-guidelinesOpen official source

When this applies

No condition recorded on this object.

When this does not apply

No exception recorded on this object.

Referring to this object

Citation block

Copy this reference into your advice, article or file. The identifier, the version and the hash keep the statement findable later, even once the dataset has moved on.

Reference

Praxikon, "Chess program using minimax and heuristic evaluation",
praxikon:eu:ai-act:example:example-schaakprogramma-minimax-heuristiek@1.0.0,
dataset praxikon:sys:registry:dataset:ai-act-implementation-graph 2.1.0 (schema 1.4.0),
effective_at 2026-08-08T00:00:00.000Z, known_at 2026-08-08T00:00:00.000Z,
sha256 ea77388b96fa6332db5b79bba1180f77661ed8b1cec9f73bed38f1cb4fd1b001,
https://www.praxikon.com/en/verkenner/example/example-schaakprogramma-minimax-heuristiek
(https://www.praxikon.com/api/v1/entities?id=praxikon%3Aeu%3Aai-act%3Aexample%3Aexample-schaakprogramma-minimax-heuristiek&effective_at=2026-08-08&known_at=2026-08-08&lang=en, accessed 2026-08-25)

Short form

praxikon:eu:ai-act:example:example-schaakprogramma-minimax-heuristiek@1.0.0 (sha256 ea77388b)

BibTeX

@misc{praxikon-eu-ai-act-example-example-schaakprogramma-minimax-heuristiek-1-0-0,
  author       = {{Praxikon}},
  title        = {Chess program using minimax and heuristic evaluation},
  year         = {2026},
  version      = {1.0.0},
  number       = {praxikon:eu:ai-act:example:example-schaakprogramma-minimax-heuristiek},
  howpublished = {AI Act Change \& Evidence Graph, dataset 2.1.0, schema 1.4.0},
  note         = {effective_at 2026-08-08T00:00:00.000Z; known_at 2026-08-08T00:00:00.000Z; sha256 ea77388b96fa6332db5b79bba1180f77661ed8b1cec9f73bed38f1cb4fd1b001},
  url          = {https://www.praxikon.com/en/verkenner/example/example-schaakprogramma-minimax-heuristiek},
  urldate      = {2026-08-25},
  language     = {en}
}

CSL JSON

[
  {
    "id": "praxikon:eu:ai-act:example:example-schaakprogramma-minimax-heuristiek@1.0.0",
    "type": "dataset",
    "title": "Chess program using minimax and heuristic evaluation",
    "container-title": "AI Act Change & Evidence Graph",
    "publisher": "Praxikon",
    "version": "1.0.0",
    "number": "praxikon:eu:ai-act:example:example-schaakprogramma-minimax-heuristiek",
    "URL": "https://www.praxikon.com/en/verkenner/example/example-schaakprogramma-minimax-heuristiek",
    "language": "en",
    "issued": {
      "date-parts": [
        [
          2026,
          8,
          8
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          8,
          25
        ]
      ]
    },
    "note": "dataset praxikon:sys:registry:dataset:ai-act-implementation-graph 2.1.0; schema 1.4.0; effective_at 2026-08-08T00:00:00.000Z; known_at 2026-08-08T00:00:00.000Z; sha256 ea77388b96fa6332db5b79bba1180f77661ed8b1cec9f73bed38f1cb4fd1b001; retrieved_from https://www.praxikon.com/api/v1/entities?id=praxikon%3Aeu%3Aai-act%3Aexample%3Aexample-schaakprogramma-minimax-heuristiek&effective_at=2026-08-08&known_at=2026-08-08&lang=en; licence https://www.praxikon.com/nl/legal/terms"
  }
]

How to verify a reference later is set out in the methodology. Terms

For agents and integrations

This page and the machine output come from the same object and the same two time axes.

Open as JSON Open as JSON-LD Read the methodology