Tags: coding chess 


# Is the King in Check? (Coding - 200 pts)

This chall is fairly simple, it can be solved by checking for threats from enemy pieces:
- For enemy queen, rooks, bishops: check the closest piece in all horizontal, vertical and diagonal directions
- For enemy knights: check all 8 possible attacking positions
- For enemy pawns: check 2 possible attacking positions

Full solver code: [kingcheck_solve.py](https://github.com/CTF-STeam/ctf-writeups/blob/master/2021/TenableCTF/kingcheck_solve.py)

(Boundary checks can be ignored, test cases do not include them. Code can be shortened further, but this was how our team solved the chall :P)

Original writeup (https://github.com/CTF-STeam/ctf-writeups/tree/master/2021/TenableCTF#is-the-king-in-check-coding---200-pts).