This paper classifies Distributed Problem Solving applications into Hierachi-cal-structured Problems and Flat-structured Problems, gives a formal description of the two-dimensional Flat-structured Problem, discusses its centralized and distributed solving approaches and analyzes their computational complexities. Theoretical analyses show: (1) the centralized knowledge-based solving is practicable. (2) the distributed solving is advantageous in increasing solving speed and reducing memory requirement.