We first introduce the framework of combinatorial reconfiguration, from the viewpoint of algorithm theory. Then, we briefly explain known proofs for computational hardness of reconfiguration problems.