Abstract
There are thousands of fans of word puzzles. Sunday newspapers and a variety of different publications present these brain teasers to their readers regularly. A fairly large subset of the word puzzles have a common logical structure. The program described in this paper can solve both single- and multi-segmented puzzles in which a one-to-one correspondence is to be found between items of different sets and the correspondence has to satisfy certain restrictions and side conditions. Ten examples with results and a detailed flowchart are included in the paper.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.