http://www.tribalwar.com/forums/archive/t-260337.html anyone know how to solve this?

Answer 1

You can indeed do it using a matrix if you have an odd number of properties, usually, and going like this:
You have some properties: name, last name, hour of visit, name of pro, last name of pro. You make a grid of (number+1)/2 columns and equal rows (so you have main squares), and then you divide each column and row by the number of possible outcomes (in this case, 4). Then, if you want, you delete all the main squares below the diagonal from the bottom left to the upper right.
You mark the rows selecting the properties, e.g. first row-name, second row-hour, third row-last name. You mark the columns in a way so that each column fills the row it cuts, so in our example, prof, last name of pro and, say, hour of visit. Then you check each small box for the clue you have, and you erase it for something that is not valid. When a combination is valid, all the other possible combinations are not valid.
I don't quite get the appointment clues. I mean, if someone goes too early, he/she can't be at noon, but it's relative. To help you a bit, a Ms can't have a masculine name, someone who is before another cannot be last etc