See jump point search on Wiktionary
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "jump point search (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": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"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 optimization to the A* search algorithm for uniform-cost grids."
],
"id": "en-jump_point_search-en-noun-RGVeW~FW",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"optimization",
"optimization"
],
[
"A*",
"A*"
],
[
"search",
"search"
],
[
"algorithm",
"algorithm"
],
[
"uniform",
"uniform"
],
[
"cost",
"cost"
],
[
"grid",
"grid"
]
],
"raw_glosses": [
"(computing theory) An optimization to the A* search algorithm for uniform-cost grids."
],
"tags": [
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "jump point search"
}
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "jump point search (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",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"An optimization to the A* search algorithm for uniform-cost grids."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"optimization",
"optimization"
],
[
"A*",
"A*"
],
[
"search",
"search"
],
[
"algorithm",
"algorithm"
],
[
"uniform",
"uniform"
],
[
"cost",
"cost"
],
[
"grid",
"grid"
]
],
"raw_glosses": [
"(computing theory) An optimization to the A* search algorithm for uniform-cost grids."
],
"tags": [
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "jump point search"
}
Download raw JSONL data for jump point search meaning in All languages combined (1.0kB)
{
"called_from": "page/1412",
"msg": "gloss may contain unhandled list items: An optimization to the A* search algorithm for uniform-cost grids.",
"path": [
"jump point search"
],
"section": "English",
"subsection": "noun",
"title": "jump point search",
"trace": ""
}
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-13 from the enwiktionary dump dated 2025-01-01 using wiktextract (4ba5975 and 4ed51a5). 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.