APA (7th ed.) Citation

Li, C., Zhang, Z., & Yang, C. (2026). King Chasing Problem in Chinese Chess is NP-hard.

Chicago Style (17th ed.) Citation

Li, Chao, Zhujun Zhang, and Chao Yang. King Chasing Problem in Chinese Chess Is NP-hard. 2026.

MLA (9th ed.) Citation

Li, Chao, et al. King Chasing Problem in Chinese Chess Is NP-hard. 2026.