![]() ![]() Pre-internet, these puzzles were popularized (in the United States) by being published by Dell Puzzle magazines under the uninspired name "logic puzzles" (as puzzles of this sort don't actually need to be solved with the grids, and some are more easily solved without them). I am not aware of an "official" term for this style of puzzle. Is there a general term(more technical than "logic grid") for this kind of puzzles and can we apply Graph Theory to solve that puzzles? I have found some papers about solving these kind of puzzles and in one them they were using logic programming with Prolog, but I'm not interested in that aspect of them.Īlso some popular puzzle questions like "Cheryl’s Birthday problem" looks similar to that puzzles and I have found an article “Now I know”: Solving logical puzzles using graphs by Catherine Greenhill. I was in quest of finding a general name for this kind of puzzle questions and what I could find are Elimination Grids and Logic Grid Puzzles. ![]() It looks like a bipartite graph matching but I just can't be sure how technically Graph Theory can applied for that kind of questions. I come across these questions occasionally and since I'm familiar with Graph Theory from my undergraduate computer science lectures, most of the time I tend to make a graph about relationships but then I can't figure out how to continue. There is a logic puzzle type that having a form of you are given some facts about the things of especially two groups, then you are asked about unclear relationships that are not given. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |