Indexed metadata

The King chasing problem in Chinese Chess is NP-hard

Chao Li, Zhujun Zhang, Chao Yang

Source record

Source: Crossref

Published: Dec 1, 2026

DOI: 10.1016/j.dam.2026.08.013

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

The King chasing problem in Chinese Chess is NP-hard — Mathematical Frontier Network