Hello I am starting on a project where I want to implement combinatorial testing with 3-way interactions of parameters or possibly even higher . Basically based on heuristic search and simulated annealing algorithms described here:http://cse.unl.edu/~myra/papers/mbcdiss.pdf
And I think that MbUnit is just mega cool framework for implementing this. I am very new to it though, however I have rather big experience with MSTEST and NUNIT/JUNIT and some other xUnit like test frameworks. I am wondering if anyone has already tried implementing combinatorial testing of higher stregth than 2 on some other projects? I know that MBUnit is by default using PairWise testing, how would you extend it to use higher strength algorithms? Some hints would be absolutley TREMENDOUS. Thank you very much for any hints in advance. /Martin --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "MbUnit.User" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/MbUnitUser?hl=en -~----------~----~----~----~------~----~------~--~---
