{"entities":{"Q7401209":{"pageid":31956356,"ns":120,"title":"Item:Q7401209","lastrevid":106628081,"modified":"2026-10-22T12:59:21Z","type":"item","id":"Q7401209","labels":{"en":{"language":"en","value":"optimal search algorithm"}},"descriptions":{"en":{"language":"en","value":"an algorithm that finds the solution with the lowest path cost"}},"aliases":{},"claims":{"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"4013be046edd745718c168633977ee4f3c066008","datavalue":{"value":"Q130370847","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7401209$1A6B99DE-20D4-4776-B449-AAD29F94DAFA","rank":"normal"}],"P36":[{"mainsnak":{"snaktype":"value","property":"P36","hash":"9fc05084429385da44d339042d989645f6cd6e12","datavalue":{"value":{"entity-type":"item","numeric-id":7271364,"id":"Q7271364"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7401209$405C4D8F-E323-4F59-8150-1BCBC975BF91","rank":"normal"}],"P95":[{"mainsnak":{"snaktype":"value","property":"P95","hash":"1115aa06b5ec0d8934344fcaf483a2490b72983f","datavalue":{"value":{"entity-type":"item","numeric-id":7400897,"id":"Q7400897"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7401209$109AEC4E-5A5B-46AA-819E-08DD21A70A8F","rank":"normal","references":[{"hash":"281fe894671eefccbd51ca20d8922bfccf27f716","snaks":{"P56":[{"snaktype":"value","property":"P56","hash":"cae51d849c51f1429fc603dd1bc6cfdb799ecbfb","datavalue":{"value":"https://cs.stanford.edu/people/eroberts/courses/soco/projects/2003-04/intelligent-search/astar.html","type":"string"},"datatype":"url"}],"P69":[{"snaktype":"value","property":"P69","hash":"67d35146f267512c1f1cbf9b4023599e419a3dce","datavalue":{"value":{"time":"+2024-09-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"}],"P220":[{"snaktype":"value","property":"P220","hash":"9ed8a421d96d0563ae9b271a7a9ee0f762209b94","datavalue":{"value":{"text":"The terms locally finite, admissible, and monotonic all aid in the understanding of when A* can be expected to be complete, meaning that it finds a solution, and optimal, meaning that it finds the solution with the lowest path cost.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"}]},"snaks-order":["P56","P69","P220"]}]}]},"sitelinks":{}}}}