{"entities":{"Q7361333":{"pageid":31519538,"ns":120,"title":"Item:Q7361333","lastrevid":105365009,"modified":"2026-10-07T13:35:32Z","type":"item","id":"Q7361333","labels":{"en":{"language":"en","value":"Alpha-Beta Pruning"}},"descriptions":{"en":{"language":"en","value":"AFP entry Alpha_Beta_Pruning"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"0e951f5b204b78e0c4d44bc974dd17bbbb2015f3","datavalue":{"value":"https://isa-afp.org/entries/Alpha_Beta_Pruning.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361333$D9FF6200-99AB-4F96-954E-05782813D0E7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ef2a31740cc5e80bddf6e9094be9322bebd71faa","datavalue":{"value":{"time":"+2024-06-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361333$37029AD8-7411-43A3-9AB7-DAEAB5DFFF5E","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"78083bbf5b06a4f292e9e00ee445948e4fa51db5","datavalue":{"value":"Tobias Nipkow","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361333$B7F9E570-914A-4457-A4DC-34F15667A460","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e01a4b89a33899529a25050022f0db380eb2e036","datavalue":{"value":{"text":"Alpha-Beta Pruning","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361333$523E328A-EE58-4441-A572-346E01340AC7","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"fa9c9718bfa68ea4b3d20afd7b80958975ad5b1c","datavalue":{"value":"Alpha-beta pruning is an efficient search strategy for two-player game trees. It was invented in the late 1950s and is at the heart of most implementations of combinatorial game playing programs. These theories formalize and verify a number of variations of alpha-beta pruning, in particular fail-hard and fail-soft, and valuations into linear orders, distributive lattices and domains with negative values. A detailed presentation of these theories can be found in the chapter Alpha-Beta Pruning in the (forthcoming) book Functional Data Structures and Algorithms --- A Proof Assistant Approach .","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361333$5C587599-0D5F-41E4-AE32-AE303A38383F","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"31bd2732819dd2b3a60eb685a5276f2b2e56cb13","datavalue":{"value":{"entity-type":"item","numeric-id":1238442,"id":"Q1238442"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361333$679964E0-8C71-4182-A60E-5FA677BEBB4A","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361333$20D792C9-0FD1-44E2-84E2-19D481F9D801","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"1157f6239d5752bb0ad1cee836272bd46c6bf40f","datavalue":{"value":{"entity-type":"item","numeric-id":7360772,"id":"Q7360772"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361333$84992281-776C-4115-B5EC-5A81DB0C8B1A","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361333$EC47166A-626D-40B0-8A82-2CA40526E9EB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Alpha-Beta Pruning","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Alpha-Beta_Pruning"}}}}}