King Chasing Problem in Chinese Chess is NP-hard

From MaRDI portal

MaRDI QIDQ7226074arXivFDO

Authors Zhujun Zhang, Chao Yang

Publication date 2026

Published in arXiv


arXiv classification

math.CO















This page was built for publication: King Chasing Problem in Chinese Chess is NP-hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7226074)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=King_Chasing_Problem_in_Chinese_Chess_is_NP-hard&oldid=107715764"
Powered by MediaWiki