With in-out games, local rule questions can usually be solved with a three step process:
- Find the local rule on the diagram.
- See what has to be true.
- Check if that is the answer.
If J is out, S has to be in. That’s all we know.
We don’t know a single thing about M or H. A-C are wrong.
D is CORRECT. S has to be in the forest.
E is wrong. You can only read the diagram left to right, from the point where you start. So we have no idea whether W, H, H and M are in or out.
So there’s no reason E has to be false. H could be in, and W, G and M could be out.
Need help with LG? → Try the LG Mastery Seminar
Solve hard games quickly