Recently, the computational complexity of video games have been analyzed. In this paper, we focus on Kirby which is one of popular video games in Japan. We investigate the computational complexity of Kirby. We prove PSPACE-completeness of Kirby by applying the general framework proposed by Aloupis et al., for proving PSPACE-hardness.