the primary purpose of this dissertation is in the search for new methods in which to search for incomplete self orthogonal latin squares. as such a full understanding of the structures involved must be examined, starting from basic latin squares. the structures will be explained and built upon in order to cover mutually orthogonal latin squares, frame latin squares and self orthogonal latin squares. in addition the related structure orthogonal arrays, will be explained as they relate to incomplete self orthogonal latin squares. this paper also dedicates time to explaining basic search methods and optimizations that can be done. the two search methods of focus are the backtracking algorithm and heuristic searches. in our 6nal method the two will work together to achieve an improved result. the methods currently being used to search in parallel are also provided, along with the necessary backup to there structure. the main research of this paper is focused on the search for incomplete self orthogonal squares. this is done by breaking down the problem into four separate areas of the square. by separating the blocks it enables us to work on a smaller problem while eliminating many incorrect solutions. the solution methodology is broken up into three steps and systematically solving the individual areas of the square. by taking advantage of the properties of squares to constrain our search as much as possible we succeeded in reducing the total search time significantly. unfortunately, even with our improvement in the overall search time, no open incomplete self orthogonal latin square problems could be solved. full results and comparisons to existing methods are provided.