Hello,

First off, this isn't an assignment, just a problem I created for myself while doing homework for a Stats class. Anyhow, for some reason I just can't think at the moment and can't figure out how to approach the problem.

Lets say we have n true false questions (or questions each having m choices). All I want to do is generate a list of all possible answers to the n questions. So if we have 4 T/F questions we'd get something like:

TTTT, TTTF, TTFT, ...

This seems like a problem you would use backtracking on, but it's been about 8 months since I learned about backtracking and did anything with it. So, I don't really remember what it entails. I also want to assume that we don't know there are 2^4 answer sets. I would like this to use a counter to return the number of answer sets.

Thanks for any nudges