  We review NP-hardness framework and PSPACE-hardness framework for a type of
2D platform games. We introduce a EXPTIME-hardness framework by defining some
new gadgets. We use these hardness frameworks to analyse computational
complexity of Xiangqi (Chinese Chess) and Janggi (Korean Chess). We construct
all gadgets of the hardness frameworks in Xiangqi and Janggi. In conclusion, we
prove that Xiangqi and Janggi are both EXPTIME-complete.
