"alpha-beta pruning" meaning in English

See alpha-beta pruning in All languages combined, or Wiktionary

Noun

Head templates: {{en-noun|-}} alpha-beta pruning (uncountable)
  1. (computing theory) An algorithm for pruning a search tree by eliminating any branch that is demonstrably inferior to a branch previously encountered. Wikipedia link: alpha-beta pruning Tags: uncountable Categories (topical): Theory of computing Translations (algorithm for pruning a search tree by eliminating inferior branches): alfa–beeta-karsinta (Finnish), poda alfa-beta [feminine] (Portuguese)
    Sense id: en-alpha-beta_pruning-en-noun-paC724OU Categories (other): English entries with incorrect language header Topics: computing, computing-theory, engineering, mathematics, natural-sciences, physical-sciences, sciences

Download JSON data for alpha-beta pruning meaning in English (1.6kB)

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "alpha-beta pruning (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "An algorithm for pruning a search tree by eliminating any branch that is demonstrably inferior to a branch previously encountered."
      ],
      "id": "en-alpha-beta_pruning-en-noun-paC724OU",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "pruning",
          "prune"
        ],
        [
          "search tree",
          "search tree"
        ],
        [
          "branch",
          "branch"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An algorithm for pruning a search tree by eliminating any branch that is demonstrably inferior to a branch previously encountered."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "translations": [
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "algorithm for pruning a search tree by eliminating inferior branches",
          "word": "alfa–beeta-karsinta"
        },
        {
          "code": "pt",
          "lang": "Portuguese",
          "sense": "algorithm for pruning a search tree by eliminating inferior branches",
          "tags": [
            "feminine"
          ],
          "word": "poda alfa-beta"
        }
      ],
      "wikipedia": [
        "alpha-beta pruning"
      ]
    }
  ],
  "word": "alpha-beta pruning"
}
{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "alpha-beta pruning (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "en:Theory of computing"
      ],
      "glosses": [
        "An algorithm for pruning a search tree by eliminating any branch that is demonstrably inferior to a branch previously encountered."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "pruning",
          "prune"
        ],
        [
          "search tree",
          "search tree"
        ],
        [
          "branch",
          "branch"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An algorithm for pruning a search tree by eliminating any branch that is demonstrably inferior to a branch previously encountered."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "alpha-beta pruning"
      ]
    }
  ],
  "translations": [
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "algorithm for pruning a search tree by eliminating inferior branches",
      "word": "alfa–beeta-karsinta"
    },
    {
      "code": "pt",
      "lang": "Portuguese",
      "sense": "algorithm for pruning a search tree by eliminating inferior branches",
      "tags": [
        "feminine"
      ],
      "word": "poda alfa-beta"
    }
  ],
  "word": "alpha-beta pruning"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.