{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:02:36Z","timestamp":1775016156622,"version":"3.50.1"},"reference-count":6,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1134\/s036176881903006x","type":"journal-article","created":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T07:03:03Z","timestamp":1560236583000},"page":"96-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Solving the Problem of 7-Piece Chess Endgames"],"prefix":"10.1134","volume":"45","author":[{"given":"V. B.","family":"Zakharov","sequence":"first","affiliation":[]},{"given":"M. G.","family":"Mal\u2019kovskii","sequence":"additional","affiliation":[]},{"given":"A. I.","family":"Mostyaev","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2019,6,11]]},"reference":[{"key":"7051_CR1","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"C.E. Shannon","year":"1950","unstructured":"Shannon, C.E., Programming a computer for playing chess, Philos. Mag., 1950, vol. 41, no. 314, pp. 256\u2013275.","journal-title":"Philos. Mag."},{"key":"7051_CR2","unstructured":"Adel\u2019son-Vel\u2019skii, G.M., Arlazarov, V.L., Bitman, A.R., and Donskoi, M.V., Mashina igraet v shakhmaty (Machine Plays Chess), Moscow: Nauka, 1983."},{"key":"7051_CR3","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1126\/science.aar6404","volume":"362","author":"D. Silver","year":"2018","unstructured":"Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., Lillicrap, T., Simonyan, K., and Hassabis, D., A general reinforcement learning algorithm that masters chess, shogi, and go through self-play, Science, 2018, vol. 362, no. 6419, pp. 1140\u20131144.","journal-title":"Science"},{"key":"7051_CR4","volume-title":"Algorithm of retrograde analysis in supercomputing systems by the example of chess, Programmnye sistemy i instrumenty. Tematicheskii sbornik (Software Systems and Tools: Thematic Collection)","author":"V.B. Zakharov","year":"2010","unstructured":"Zakharov, V.B. and Makhnychev, V.S., Algorithm of retrograde analysis in supercomputing systems by the example of chess, Programmnye sistemy i instrumenty. Tematicheskii sbornik (Software Systems and Tools: Thematic Collection), Korolev, L., Korukhov, L.S., and Kostenko, V.A., Eds., Moscow: Mosk. Gos. Univ., 2010, vol. 11, pp. 45\u201352."},{"key":"7051_CR5","unstructured":"Zakharov, V.B. and Makhnychev, V.S., Creating chess tables of 7-piece endgames on a Lomonosov supercomputer, Superkomp\u2019yut., 2013, no. 15, pp. 34\u201337."},{"key":"7051_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.3103\/S0278641916010076","volume":"40","author":"V.B. Zakharov","year":"2016","unstructured":"Zakharov, V.B., Mal\u2019kovskii, M.G., and Shchukin, Y.V., Compression of underdetermined data in a 7-piece chess table, Moscow Univ. Comput. Math. Cybern., 2016, vol. 40, no. 1, pp. 47\u201352.","journal-title":"Moscow Univ. Comput. Math. Cybern."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S036176881903006X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S036176881903006X","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S036176881903006X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:34:20Z","timestamp":1775010860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S036176881903006X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["7051"],"URL":"https:\/\/doi.org\/10.1134\/s036176881903006x","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5]]},"assertion":[{"value":"14 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}