I'm going to implement the McKluskey algorithm for boolean expression simplification in Perl, sometime.
I missed the first test 'cause of my travel to Europe and I want to see if this program replaces the grade I missed. Otherwise, I'll have to make a substitutive test by the end of the school year (it will be in March or April... :-P) to replace that grade.
It is not that difficult and I think that with Bit::Vector I can work nicely with the expressions and do all required simplifications.
Probably the hardest part will be the map to check for required primes...
