{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T23:18:18Z","timestamp":1761175098499,"version":"build-2065373602"},"reference-count":33,"publisher":"Polish Information Processing Society","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.15439\/2025f6497","type":"proceedings-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:44:23Z","timestamp":1761119063000},"page":"801-806","source":"Crossref","is-referenced-by-count":1,"title":["Estimating the Difficulty of Chess Puzzles by Combining Fine-Tuned Maia-2 with Hand-Crafted and Engine Features"],"prefix":"10.15439","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9039-8623","authenticated-orcid":true,"given":"Sebastian","family":"Bj\u00f6rkqvist","sequence":"first","affiliation":[{"name":"IPRally"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6175","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"ref1","unstructured":"Lichess.org, \u201cLichess training,\u201d https:\/\/lichess.org\/training, 2025, accessed: 2025-08-16."},{"key":"ref2","unstructured":"Chess.com, \u201cChess.com puzzles,\u201d https:\/\/www.chess.com\/puzzles, 2025,\naccessed: 2025-08-16."},{"key":"ref3","unstructured":"ChessTempo, \u201cChesstempo,\u201d https:\/\/chesstempo.com\/, 2025, accessed:\n2025-08-16."},{"key":"ref4","unstructured":"T.\n Duplessis,\n \u201clichess\n puzzler,\u201d\n https:\/\/github.com\/ornicar\/lichess-puzzler.\n [Online].\n Available:\n https:\/\/github.com\/ornicar\/lichess-puzzler"},{"key":"ref5","unstructured":"A. E. Elo, The Rating of Chessplayers, Past and Present. New\nYork: Arco Pub., 1978. ISBN 0668047216 9780668047210. [Online].\nAvailable: http:\/\/www.amazon.com\/Rating-Chess-Players-Past-Present\/dp\/0668047216"},{"key":"ref6","unstructured":"M. E. Glickman, \u201cExample of the glicko-2 system,\u201d http:\/\/www.glicko.net\/glicko\/glicko2.pdf, 2022, published: 2022-03-22, accessed: 2025-08-16."},{"key":"ref7","doi-asserted-by":"publisher","unstructured":"J. Zy\u015bko, M. \u015al\u0119zak, D. \u015al\u0119zak, and M. \u015awiechowski, \u201cFedCSIS 2025\nknowledgepit.ai Competition: Predicting Chess Puzzle Difficulty Part\n2 & A Step Toward Uncertainty Contests,\u201d in Proceedings of the\n20th Conference on Computer Science and Intelligence Systems, ser.\nAnnals of Computer Science and Information Systems, M. Bolanowski,\nM. Ganzha, L. Maciaszek, M. Paprzycki, and D. \u015al\u0119zak, Eds., vol. 43.\nPolish Information Processing Society, 2025. https:\/\/dx.doi.org\/10.15439\/2025F5937.\n[Online]. Available: http:\/\/dx.doi.org\/10.15439\/2025F5937","DOI":"10.15439\/2025F5937"},{"key":"ref8","doi-asserted-by":"crossref","unstructured":"J. Zy\u015bko, M. \u015awiechowski, S. Stawicki, K. Jagie\u0142a, A. Janusz, and\nD. \u015al\u0119zak, \u201cIeee big data cup 2024 report: Predicting chess puzzle\ndifficulty at knowledgepit.ai,\u201d in IEEE International Conference on Big\nData, Big Data 2024, Washington DC, USA, December 15-18, 2024.\nIEEE, 2024.","DOI":"10.1109\/BigData62323.2024.10825289"},{"key":"ref9","unstructured":"Z. Tang, D. Jiao, R. McIlroy-Young, J. Kleinberg, S. Sen, and A. Anderson, \u201cMaia-2: A unified model for human-ai alignment in chess,\u201d Advances in Neural Information Processing Systems, vol. 37, pp. 20 919\u201320 944, 2024."},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"T. Woodruff, O. Filatov, and M. Cognetta, \u201cThe bread emoji team\u2019s\nsubmission to the ieee bigdata 2024 cup: Predicting chess puzzle\ndifficulty challenge,\u201d in 2024 IEEE International Conference on Big\nData (BigData). IEEE, 2024, pp. 8415\u20138422.","DOI":"10.1109\/BigData62323.2024.10826037"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"A. Sch\u00fctt, T. Huber, and E. Andr\u00e9, \u201cEstimating chess puzzle difficulty\nwithout past game records using a human problem-solving inspired\nneural network architecture,\u201d in 2024 IEEE International Conference\non Big Data (BigData). IEEE, 2024, pp. 8396\u20138402.","DOI":"10.1109\/BigData62323.2024.10826087"},{"key":"ref12","doi-asserted-by":"crossref","unstructured":"S. Bj\u00f6rkqvist, \u201cEstimating the puzzlingness of chess puzzles,\u201d in 2024\nIEEE International Conference on Big Data (BigData). IEEE, 2024,\npp. 8370\u20138376.","DOI":"10.1109\/BigData62323.2024.10825991"},{"key":"ref13","unstructured":"S. Stoiljkovikj, I. Bratko, M. Guid, and F. UNI, \u201cA computational model\nfor estimating the difficulty of chess problems,\u201d in Proceedings of the\nthird annual conference on advances in cognitive systems ACS, 2015,\np. 7."},{"key":"ref14","unstructured":"D. Hristova, M. Guid, and I. Bratko, \u201cAssessing the difficulty of chess\ntactical problems,\u201d International journal on advances in intelligent\nsystems, vol. 7, no. 3, pp. 728\u2013738, 2014."},{"key":"ref15","doi-asserted-by":"publisher","unstructured":"R. McIlroy-Young, S. Sen, J. Kleinberg, and A. Anderson, \u201cAligning\nsuperhuman ai with human behavior: Chess as a model system,\u201d\nin Proceedings of the 26th ACM SIGKDD International Conference\non Knowledge Discovery & Data Mining, ser. KDD \u201920. New\nYork, NY, USA: Association for Computing Machinery, 2020.\nhttps:\/\/dx.doi.org\/10.1145\/3394486.3403219. ISBN 9781450379984 p. 1677\u20131687.\n[Online]. Available: https:\/\/doi.org\/10.1145\/3394486.3403219","DOI":"10.1145\/3394486.3403219"},{"key":"ref16","unstructured":"The LCZero Authors, \u201cLeela chess zero.\u201d [Online]. Available:\nhttps:\/\/lczero.org\/"},{"key":"ref17","unstructured":"G. Ke, Q. Meng, T. Finley, T. Wang, W. Chen, W. Ma, Q. Ye, and T.-Y.\nLiu, \u201cLightgbm: a highly efficient gradient boosting decision tree,\u201d in\nProceedings of the 31st International Conference on Neural Information\nProcessing Systems, ser. NIPS\u201917.\n Red Hook, NY, USA: Curran\nAssociates Inc., 2017. ISBN 9781510860964 p. 3149\u20133157."},{"key":"ref18","doi-asserted-by":"crossref","unstructured":"A. Rafaralahy, \u201cPairwise learning to rank for chess puzzle difficulty prediction,\u201d in 2024 IEEE International Conference on Big Data (BigData).\nIEEE, 2024, pp. 8385\u20138389.","DOI":"10.1109\/BigData62323.2024.10825356"},{"key":"ref19","doi-asserted-by":"crossref","unstructured":"S. Mi\u0142osz and P. Kapusta, \u201cPredicting chess puzzle difficulty with\ntransformers,\u201d in 2024 IEEE International Conference on Big Data\n(BigData). IEEE, 2024, pp. 8377\u20138384.","DOI":"10.1109\/BigData62323.2024.10825919"},{"key":"ref20","doi-asserted-by":"crossref","unstructured":"D. Ruta, M. Liu, and L. Cen, \u201cMoves based prediction of chess\npuzzle difficulty with convolutional neural networks,\u201d in 2024 IEEE\nInternational Conference on Big Data (BigData). IEEE, 2024, pp.\n8390\u20138395.","DOI":"10.1109\/BigData62323.2024.10825595"},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"M. Omori and P. Tadepalli, \u201cChess rating estimation from moves and\nclock times using a cnn-lstm,\u201d in International Conference on Computers\nand Games. Springer, 2024, pp. 3\u201313.","DOI":"10.1007\/978-3-031-86585-5_1"},{"key":"ref22","unstructured":"Lichess.org, \u201cLichess open database: Chess puzzles,\u201d https:\/\/database.lichess.org\/#puzzles, 2025, accessed: 2025-08-16."},{"key":"ref23","unstructured":"Wikipedia contributors, \u201cForsyth\u2013edwards notation \u2014 Wikipedia,\u201d https:\/\/en.wikipedia.org\/wiki\/Forsyth%E2%80%93Edwards_Notation, 2025,\naccessed: 2025-08-16."},{"key":"ref24","unstructured":"Wikipedia contributors, \u201cAlgebraic Notation (Chess) \u2014 Wikipedia,\u201d https:\/\/en.wikipedia.org\/wiki\/Algebraic_notation_(chess), 2025, accessed: 2025-08-16."},{"key":"ref25","unstructured":"A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan,\nT. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. K\u00f6pf,\nE. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner,\nL. Fang, J. Bai, and S. Chintala, PyTorch: an imperative style, high-performance deep learning library.\n Red Hook, NY, USA: Curran\nAssociates Inc., 2019."},{"key":"ref26","unstructured":"A. Defazio, X. Yang, A. Khaled, K. Mishchenko, H. Mehta, and\nA. Cutkosky, \u201cThe road less scheduled,\u201d Advances in Neural Information\nProcessing Systems, vol. 37, pp. 9974\u201310 007, 2024."},{"key":"ref27","unstructured":"A. V. Dorogush, V. Ershov, and A. Gulin, \u201cCatboost: gradient boosting\nwith categorical features support,\u201d arXiv preprint https:\/\/arxiv.org\/abs\/1810.11363,\n2018. [Online]. Available: https:\/\/arxiv.org\/abs\/1810.11363"},{"key":"ref28","unstructured":"Leela Chess Zero contributors, \u201cBest networks for lc0,\u201d https:\/\/lczero.org\/dev\/wiki\/best-nets-for-lc0\/, 2024, accessed: 2025-07-25.\n[Online]. Available: https:\/\/lczero.org\/dev\/wiki\/best-nets-for-lc0\/"},{"key":"ref29","unstructured":"dkappe, \u201cLeela chess weights: Bad gyal,\u201d https:\/\/github.com\/dkappe\/leela-chess-weights\/wiki\/Bad-Gyal, 2020, GitHub release,\naccessed 2025-07-25. [Online]. Available: https:\/\/github.com\/dkappe\/leela-chess-weights\/wiki\/Bad-Gyal"},{"key":"ref30","unstructured":"Leela Chess Zero contributors, \u201cContributed networks for lc0,\u201d https:\/\/storage.lczero.org\/files\/networks-contrib\/, 2024, accessed: 2025-07-26.\n[Online]. Available: https:\/\/storage.lczero.org\/files\/networks-contrib\/"},{"key":"ref31","unstructured":"The Stockfish developers, T. Romstad, M. Costalba, J. Kiiski,\nG. Linscott, Y. Nasu, M. Isozaki, and H. Noda, \u201cStockfish.\u201d [Online].\nAvailable: https:\/\/stockfishchess.org\/"},{"key":"ref32","unstructured":"N. Fiekas, \u201cpython-chess: a chess library for python,\u201d https:\/\/github.com\/niklasf\/python-chess, 2025. [Online]. Available: https:\/\/github.com\/niklasf\/python-chess"},{"key":"ref33","doi-asserted-by":"crossref","unstructured":"W. McKinney, \u201cData structures for statistical computing in python,\u201d in\nProceedings of the 9th Python in Science Conference, S. van der Walt\nand J. Millman, Eds., 2010, pp. 51 \u2013 56.","DOI":"10.25080\/Majora-92bf1922-00a"}],"event":{"name":"20th Conference on Computer Science and Intelligence Systems (FedCSIS)","theme":"Computer Science and Intelligence Systems","location":"Krak\u00f3w, Poland","acronym":"FedCSIS","number":"20","start":{"date-parts":[[2025,9,14]]},"end":{"date-parts":[[2025,9,17]]}},"container-title":["Annals of Computer Science and Information Systems","Proceedings of the 20th Conference on Computer Science and Intelligence Systems (FedCSIS)"],"original-title":[],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:52:01Z","timestamp":1761119521000},"score":1,"resource":{"primary":{"URL":"https:\/\/annals-csis.org\/Volume_43\/drp\/6497.html"}},"subtitle":[],"proceedings-subject":"Computer Science and Information Systems","short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":33,"URL":"https:\/\/doi.org\/10.15439\/2025f6497","relation":{},"ISSN":["2300-5963"],"issn-type":[{"value":"2300-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2025,10,15]]}}}