{"entities":{"Q1534985":{"pageid":1545725,"ns":120,"title":"Item:Q1534985","lastrevid":67843155,"modified":"2026-04-12T19:53:03Z","type":"item","id":"Q1534985","labels":{"en":{"language":"en","value":"Placing \\(n\\) queens on the chessboard of \\(n^2\\) squares so that none can be captured by another (for \\(n=4\\) to \\(n=10\\))."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2691643"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1534985$6FE4E356-81C2-43C2-8920-D18E1AFFDDFE","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"bb7167509669cbbad2f77d692f6f397849d93ccb","datavalue":{"value":{"text":"Placing \\(n\\) queens on the chessboard of \\(n^2\\) squares so that none can be captured by another (for \\(n=4\\) to \\(n=10\\)).","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1534985$ED7B227E-7498-445E-A582-88A230B6F085","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c7363ee344c1666ad25d2ce3ae6bbcb825576b2a","datavalue":{"value":"21.0202.01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1534985$E13E8201-895A-4A70-B947-CB4B31DEA0C7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c479c91839752d8e51cc8d3ff8f1b920ae8b3ad4","datavalue":{"value":{"entity-type":"item","numeric-id":1534984,"id":"Q1534984"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1534985$0F06DE38-F205-4326-A3D6-83FCAEF01242","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0e704d55b7099cfc635cad3185f541fb10c025c3","datavalue":{"value":{"time":"+1889-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1534985$27A5C640-98C8-432A-A156-663BD2411600","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"de01550be78cd4548264d06f89fd4ac0d2a0f812","datavalue":{"value":"Eine ausf\u00fchrliche Darstellung dieses Problems, auch in seinen verschiedenen rein mathematischen Fassungen. Es werden eingehend die L\u00f6sungen und die dazu angewandten Methoden besprochen, welche f\u00fcr die F\u00e4lle bis \\(n = 8\\) von Nauck, Gauss, Natani, S. G\u00fcnther, Glaisher und de la No\u00eb gegeben worden sind. Auf Grund der G\u00fcnther'schen Bezeichnungsart findet sodann der Herr Verfasser als Anzahl der L\u00f6sungen f\u00fcr Schachbrette von 81 und 100 Feldern die Werte 352 und 724. Da diese Zahlen jedoch nicht auf rein mathematischem Wege, sondern mehr durch Probiren gefunden sind, so bed\u00fcrfen sie, wie auch Herr Pein zugiebt, noch der Pr\u00fcfung.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1534985$EE6B84AC-7D08-4A9A-B311-4B34E10EB72A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"86c47e3aedde4615dd16421ee43ac00d4048a5ec","datavalue":{"value":"05B30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1534985$0C92C00C-3E57-4BAC-8AE5-0DA35EDF2F2B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"eb06e543dd911788cb3c242d46064883abf08ca4","datavalue":{"value":"2691643","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1534985$9BD6917E-3258-4CD8-8737-83E9FDF39050","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f5a94f74a76b1ea877a74da9474b9076a4b74565","datavalue":{"value":"queens on a chessboard","type":"string"},"datatype":"string"},"type":"statement","id":"Q1534985$D22937BB-7C2A-4A5F-A5E3-D67E297D015A","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1534985$AF4F9DF1-1445-4FFC-803B-D403B684E275","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Placing \\(n\\) queens on the chessboard of \\(n^2\\) squares so that none can be captured by another (for \\(n=4\\) to \\(n=10\\)).","badges":[]}}}}}