{"entities":{"Q7400892":{"pageid":31946789,"ns":120,"title":"Item:Q7400892","lastrevid":106628153,"modified":"2026-10-22T12:59:23Z","type":"item","id":"Q7400892","labels":{"en":{"language":"en","value":"admissible search algorithm"}},"descriptions":{"en":{"language":"en","value":"algorithm that is always optimistic; it either underestimates the path cost to the goal or provides a correct estimate for the path cost to the goal, but it never overestimates the path cost to the goal"}},"aliases":{"en":[{"language":"en","value":"admissible algorithm"}]},"claims":{"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"5da76399b09235ff364769cb3804e03b158732c2","datavalue":{"value":"Q130370867","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7400892$7B4AB9A6-6475-4ECD-9EDC-C30F81589361","rank":"normal"}],"P36":[{"mainsnak":{"snaktype":"value","property":"P36","hash":"c6b7be1c5fc109274348e293d8db2c47d1f5c19c","datavalue":{"value":{"entity-type":"item","numeric-id":7275915,"id":"Q7275915"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7400892$53895619-8E86-429D-B133-AC9CB3BD1144","rank":"normal"}],"P265":[{"mainsnak":{"snaktype":"value","property":"P265","hash":"ec31fddb72c9ef2c001706e61a31c821068550dd","datavalue":{"value":{"entity-type":"item","numeric-id":7401491,"id":"Q7401491"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7400892$8B41185E-B4AA-401F-B089-0A7FD9B1D0AA","rank":"normal","references":[{"hash":"4976b7badf0b944a855b0c56573949f1480160c3","snaks":{"P56":[{"snaktype":"value","property":"P56","hash":"23256de8041680b299e9b231b485040ceb2bd782","datavalue":{"value":"https://www.geeksforgeeks.org/a-is-admissible/","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":"a065a4ebaa895d37ef82809001b82fadcef5021a","datavalue":{"value":{"text":"The cost of reaching the goal state is assessed using an admissible heuristic in an informed search algorithm, however, if we need to discover a solution to the problem, the estimated cost must be lower than or equal to the true cost of reaching the goal state.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"}]},"snaks-order":["P56","P69","P220"]}]}]},"sitelinks":{}}}}