Skip to content
Agentmart
Submit a tool

FIDE Laws of Chess

FIDE Laws of Chess (2023) as an executable model: arbiter cases, answers with rules and judgments

Connector by arxo.io · Domain verified by the MCP Registry

IndexedApache-2.0Local (stdio)Remote (HTTP)
Write a review

Install

Works with Claude Code, VS Code, Codex, Cursor, Windsurf, Claude Desktop. Read the repository before you give any tool access to your data.

npx agentmarket install connector/arxo-io-fide-chess

Asks which of your tools to add it to (Claude Code, Codex, Cursor, VS Code, Windsurf, Gemini CLI, Claude Desktop) and shows the change first. See https://agentmart.dev/cli.

Remote endpoint

  • https://mcp.arxo.io/mcp/fide-chess Remote (HTTP)

Get the weekly diff

The weekly diff: one email a week with new agent tools, notable updates and grade changes, plus security alerts for tools you follow. Double opt-in, one-click unsubscribe.

We use your email only for this newsletter. Privacy

About

FIDE Laws of Chess (2023) as an executable model: arbiter cases, answers with rules and judgments

No reviews yet. Installed it? Reviews come from verified installers only. How reviews work

Permissions

What this server can do and what it asks for, from its tool list, install config and code. Checked Oct 26, 2026.

Tools
13 read · 2 write · 1 delete
Secrets
None asked for
Install scripts
None found
Runs as
Node.js package

Tools by what they do 16

From the running server's own tool list (tools/list) on Oct 25, 2026.

Read 13 · Look things up without changing anything.

  • law_answer_capabilities
  • law_ask
  • law_capture_answer
  • law_case_ask
  • law_explain
  • law_inspect
  • law_packages
  • law_passport
  • law_query
  • law_rules
  • law_screen
  • law_search
Show 1 more tools
  • law_sources

Write 2 · Create, change, send or run things.

  • law_prepare_answer
  • law_publish_answer

Delete 1 · Delete, drop, revoke or wipe things.

  • law_revoke_answer

Secrets and settings it asks for

Other settings (environment variables or headers).

  • FIDE_CHESS_MCP_CALL_TIMEOUT

Network hosts it talks to 4

  • foreign-origin.invalid · found in code
  • github.com · found in code
  • law.arxo.io · found in code
  • mcp.arxo.io · found in remote endpoint, install command, code

Files it touches

  • /private/var
  • /proc
  • /Users
  • /usr/sbin/nginx

Tools (16)

As the server listed them on Oct 25, 2026. Descriptions are the server’s own words; hidden characters are shown as [U+…].

  • law_answer_capabilitiesLens capabilitiesread-only

    A machine-readable matrix of the Lens producers that are actually installed, of replay/projection checks, profiles, limits and the contract tests that confirm them. declared_only means a schema with no executable witness.

  • law_askAsk the lawread-only

    Put a question to formalised law. When the answer is "not established" it carries whyNot — the engine's why_not report: the candidate rules and the state of every conjunct (satisfied / not satisfied / undetermined); the missing facts are visible there and need not be guessed. BEFORE THE FIRST call obtain the predicate names through law_search (a question in your own words → addresses) or law_packages (the signatures of a known instrument) — an invented name will be rejected. If the tool returned an error or "not established", THAT IS THE ANSWER: pass it to the user and do not substitute genera…

  • law_capture_answerCapture a result for a Lensread-only

    Run a registered producer and obtain producerControl/0.2 for a later verifiable preparation of a Lens. The producer is chosen only from the shipped registry.

  • law_case_askCase package: askread-only

    The ask operation: run a registered case of a case package over its pinned dependencies and return the answer: by default a projection of the evaluation document without the proof graph, on responseMode full or proof: true the canonical document with a proof and a manifest. The question is JSON per query.schema.json (query), an evaluate string (evaluate + queryId), a saved queryId without query, or card + args. A refusal to prepare is an error with an LDC-* code, never an empty answer.

  • law_explainUnfold the proofread-only

    Unfold the proof of a law_ask answer into a chain "rule ← premises → conclusion". The compact input: question (the original law_ask arguments, truth/collect), resultHash and codeHash from the provenance of the answer. The server repeats the computation and compares the hashes; if anything changed it refuses explicitly. Alternatively pass the evaluation from law_ask(proof=true). answerResource=fullAnswer.uri explains a stored compact snapshot without recomputing and without the client loading pages; by default only the proofRef chain. nodeId selects one node and all of its premises (up to 24 KB…

  • law_inspectEvaluation inspectorread-only

    Evaluation inspector over a SAVED evaluation document: summary — the origin card, resultHash and snapshot verification, listings of results, positions and issues; slice — the closure of proof nodes for a query, rule, position or node with addresses, both sides of BOTH, defeats, values, names resolved against the snapshot; diff — what changed between two documents on the context, result and justification levels; locate — the declaration by StableId. Nothing is evaluated or recomputed: the source is evaluation from law_ask(proof=true) or an answerResource. Missing data is a limit state (limits),…

  • law_packagesCatalogue of lawread-only

    The catalogue of formalised law: instruments, predicates with signatures, the boundaries of coverage. This is where the NAMES of predicates come from — they must never be guessed. But do NOT start from the catalogue when looking for the right instrument: the overview is large, and the title of an instrument rarely matches the words of a question ("Newton's laws of motion" contains no word "physics"). A question in your own words goes to law_search first, which returns addresses; the catalogue is for the exact signature of what you found. With no arguments — the overview: one line per instrumen…

  • law_passportRelease passportread-only

    Passport of an exact release: purpose, interface, boundaries, checks and performance. The reports section holds the history of measurements, failures included. Entries are paged by JSON Pointer; next continues the answer.

  • law_prepare_answerPrepare a public write-up

    At the explicit request of the user, repeat between 1 and 12 earlier law_ask or law_process_run calls, compare their replayControl strictly, and prepare a non-public frozen document for 24 hours. The client never supplies the machine answer: the server obtains it only by executing afresh. A divergence in any input, in the law, in a resource, in the server code, in the engine library or in the result rejects the document as a whole.

  • law_publish_answerPublish a write-up

    Publish a prepared document. Repeating it with the same preparationId idempotently returns the same URL and the same separate revocation secret.

  • law_queryLawQL queryread-only

    A deterministic LawQL query over the CLIR of a formalization: a question about the model of the act itself, not about a case. Relations (14): anchors, edges, fields, imports, interpretations, labels, links, literals, nodes, norms, positions, rules, variables, windows. Full field lists: `law query --schema`. Functions (9): anchor/1, labels/1..2, short/1, contains/2, overlaps/2, starts_with/2, ends_with/2, position/2, derivation/2. exists/not exists over a bound variable; equality and membership only, no arithmetic and no ordering comparisons. Scope: corpus by package.name (for example kz.corpus…

  • law_revoke_answerRevoke a write-upcan change or delete data

    Revoke a published document using its separate secret. The public id alone grants no control; revocation closes the HTML page, the API and the download.

  • law_rulesRules of inferenceread-only

    The rules of formalised law put into words: exactly how a predicate is derived (premises, source articles). Call this BEFORE supplying facts to law_ask — the rules say which facts are needed instead of leaving them to be guessed. For large instruments package=… returns a table of contents; the full text comes from predicate=…. The listing by package is paged: limit (20 by default, 500 at most) and offset; the remainder is named in the text (`showing a–b of N; k more`) and in structuredContent (total, truncated, next — a ready-made continuation call).

  • law_screenPopulation screeningread-only

    Build a necessary condition — a superset — for the preliminary selection of rows from an external source. This is NOT a legal answer and NOT SQL: the result is a typed tree and a manifest of the extensions up to TRUE. Every row that passes must then be computed in full by the engine, with a proof graph, on the same snapshot of the data. The binding is passed as a pinnable object; sourceSchemaContentHash is the actual hash of the source schema and is compared loudly with the pin. Case facts that carry provenance (origin, document, quote, extractor) are supplied to law_ask, not here. The confide…

  • law_searchSearch by meaningread-only

    A semantic SEARCH over formalised law: a question or a notion in your own words → candidates with addresses — predicates with signatures, rules, article fragments. This is the layer of DISCOVERY, not of the answer: the result says WHAT to ask next (law_ask by signature, law_rules, law_sources) and establishes neither a fact nor a norm. The ranking is a deterministic lexical embedder, and similarity of text is not applicability of a norm. If you know the exact name, go straight to law_packages/law_ask; an empty result does NOT mean the norm does not exist.

Show 1 more tools
  • law_sourcesOfficial textread-only

    Sources: by default short excerpts (view=summary), 5 texts per page, with the address of the full text in fragments[].full. Either package or fragment is required (a StableId from law_search/law_rules). view=full returns exact parts of the text: textRange sets a range of Unicode characters, fragments[].next is the continuation with a contentHash. The hash refers to the WHOLE source, not to the excerpt or the part. textOffset/textLimit require fragment; a continuation requires contentHash. Lists are paged with offset/limit; the answer budget may shrink a page.

Signals

Stars
0
Forks
0
Open issues
0
Weekly downloads
56
Last commit
Oct 14, 2026 (14 days ago)
Last release
Oct 14, 2026 (14 days ago)
Last package publish
Oct 14, 2026 (14 days ago)

From GitHub (fetched Oct 24, 2026) and the package registry.

Details

Registry name
io.arxo/fide-chess
Version
0.1.1
Auth
Auth not stated
License
Apache-2.0
First seen
Oct 24, 2026
Last checked
Oct 25, 2026

More from arxo.io

Cite this page

FIDE Laws of Chess MCP server. Agent Mart. https://agentmart.dev/connectors/arxo-io-fide-chess (last updated 2026-10-25)