Combinatorial testing (CT) is an essential technique that usually aims for the generation of test cases. The generation of an optimally sized test case is a Non-deterministic Polynomial (NP) problem. The Combinatorial Interaction has been discussed by several researchers in developing different strategies depending on support interactions. Combinatorial testing taxonomy is thus Suggested to facilitate the analysis. In this paper, 12 algorithms were evaluated based on the strategy approach, supported interactions, randomness, and publication year. The year 2011 was noted as the most successful year in which researchers generated t-way algorithms. For them, the one-test-per-time OTAT strategy was the most promising area for Combinatorial t-way analysis. A small variation was seen in the type of interaction support. Nonetheless, uniform strength was the most common form of interaction from the year 2010 to the first half of the year 2018. This article was therefore implemented to review existing t-way strategies to identify their capabilities and limitations, thus providing a valuable guideline for generating the future.
