MediaWiki API result
This is the HTML representation of the JSON format. HTML is good for debugging, but is unsuitable for application use.
Specify the format parameter to change the output format. To see the non-HTML representation of the JSON format, set format=json.
See the complete documentation, or the API help for more information.
{
"batchcomplete": "",
"continue": {
"sroffset": 10,
"continue": "-||"
},
"query": {
"searchinfo": {
"totalhits": 38
},
"search": [
{
"ns": 0,
"title": "BELCT 2001",
"pageid": 527,
"size": 10909,
"wordcount": 1295,
"snippet": "...n [https://de.wikipedia.org/wiki/Dem_deutschen_Volke Dem deutschen Volke], <span class='searchmatch'>meaning</span> To the German people or For the German people</ref> \n",
"timestamp": "2022-11-17T11:22:40Z"
},
{
"ns": 0,
"title": "The Bernstein Chess Program",
"pageid": 939,
"size": 10948,
"wordcount": 1607,
"snippet": "...sure, what he called a \u201c[[King Pattern|greens area]]\u201d around the king, <span class='searchmatch'>meaning</span> that the more squares outward from the king controlled by his own side the \n",
"timestamp": "2021-02-25T16:38:29Z"
},
{
"ns": 0,
"title": "Fail-High",
"pageid": 1032,
"size": 5603,
"wordcount": 759,
"snippet": "Another <span class='searchmatch'>meaning</span> of a '''Fail-High''', is associated with [[Aspiration Windows]] at the [[Ro\n",
"timestamp": "2020-04-11T08:22:51Z"
},
{
"ns": 0,
"title": "Chessmaps Heuristic",
"pageid": 1034,
"size": 11061,
"wordcount": 1358,
"snippet": "...luation processes. It provides complete information about its environment, <span class='searchmatch'>meaning</span> that the evaluation functions can be reliable, and is not so complex that t\n",
"timestamp": "2020-02-05T21:25:21Z"
},
{
"ns": 0,
"title": "David Levy",
"pageid": 1038,
"size": 35596,
"wordcount": 4953,
"snippet": "...many people have asked me the inevitable question, "Did they all pay up?", <span class='searchmatch'>meaning</span> the four people with whom I made the bet. I should like to use the pages of\n",
"timestamp": "2021-03-21T08:55:46Z"
},
{
"ns": 0,
"title": "Repetitions",
"pageid": 1051,
"size": 34528,
"wordcount": 4898,
"snippet": "...robed. This flag stays set until the position is no longer being searched, <span class='searchmatch'>meaning</span> when the search function returns a value for that position.\n",
"timestamp": "2022-08-21T10:51:23Z"
},
{
"ns": 0,
"title": "Fail-Low",
"pageid": 1078,
"size": 5972,
"wordcount": 812,
"snippet": "Another <span class='searchmatch'>meaning</span> of a '''Fail-Low''', is associated with [[Aspiration Windows|aspiration win\n",
"timestamp": "2020-04-08T18:53:31Z"
},
{
"ns": 0,
"title": "Parallel Search",
"pageid": 1295,
"size": 87966,
"wordcount": 11607,
"snippet": "...s to make the integer nonzero. This whole process must be done atomically, <span class='searchmatch'>meaning</span> that the read, compare, and write are all done at the same time. Without th\n...e can waste a lot of processing time in applications with high contention, <span class='searchmatch'>meaning</span> that many processes try to access the same semaphore simultaneously. In che\n",
"timestamp": "2021-11-11T16:34:01Z"
},
{
"ns": 0,
"title": "Perft",
"pageid": 1330,
"size": 30211,
"wordcount": 4128,
"snippet": "...p://www.talkchess.com/forum/viewtopic.php?t=27334 What is perft(x) exactly <span class='searchmatch'>meaning</span>?] by [[Jouni Uski]], [[CCC]], April 06, 2009\n",
"timestamp": "2024-03-16T03:07:36Z"
},
{
"ns": 0,
"title": "Herbert Simon",
"pageid": 1436,
"size": 32626,
"wordcount": 4861,
"snippet": "...t Simon]], [[Laurent Sikl\u00f3ssy]] (eds.) ('''1972'''). ''Representation and <span class='searchmatch'>Meaning</span>: Experiments with Information Processing Systems''. [https://en.wikipedia.\n",
"timestamp": "2020-11-16T15:13:48Z"
}
]
}
}