Irving?s algorithm is the solution Robert W. Irving proposed to Gale and Shapley?s Stable Roommate problem. It determines if there is a possible stable match in each set using a list of preferences, and if it is possible, finds the stable matches. However, incomplete preference lists would increase the chances of having one participant become unmatched. This paper introduces an enhanced version of this algorithm that uses the addition of descriptive lists to fill in the vacancies in the incomplete preference list. The conclusion is that it is more efficient to fill the vacancies according to approximate preference rather than leaving the lists as incomplete to create more stable matches.