Coloured Matrix

Problem description: The square field consists of M × M cells. Each cell is colored in one of three colors (1,2,3). The initial state is chosen in one of the cells of color 1. In each step one allowed to move one cell up, down, left or right remaining inside the field. You are to define the worst minimal amount of steps one should make to get a cell of color 3 independent on the initial state.