Is there a way to write pmatch questions to account for a user inputting a few answers from a short list of possibilities (like a combination problem where there are N total possible answers and they need to input K of them)?
For a very simplified example question:
"what are any 4 of the first 8 letters of the alphabet?"
A, B, C, D, E, F, G, H are all possibilities, but I'm unsure how (if even possible) to make an answer that will check for at least any 4 of them.
As more of a closer to useful example, I have been doing this to help account for partial credit (although it isn't doing the same thing my question was about, I felt it was kind of related):
"Atoms are composed of three subatomic particles, each with a different net electric charge: one positive, one negative, and one with no net charge. These particles are called __30x1__ , respectively.
(Please enter your answers as a comma separated list: e.g. green, purple, yellow)
match_mw (proton? electron? neutron?) - 100%
match_mw (proton? neutron? electron?) - 66.666%
match_mw (* * neutron?) - 33.3333%
.....etc. for all possibilities"
Thanks for any advice!