An important class of problems in combinatorics is to find orthogonal latin squares with certain properties.Computer search is a promising approach for solving such problems.But generally its worstcase complexity is high.This paper describes how to use a general-purpose model searching program to find orthogonal latin squares.New techniques for problem representation and symmetry breaking are proposed to increase search efficiency.