{"id":27040000,"url":"https://github.com/cdvel/super-word-search","last_synced_at":"2025-06-18T20:35:21.784Z","repository":{"id":35365710,"uuid":"39628572","full_name":"cdvel/super-word-search","owner":"cdvel","description":"Yet another crossword puzzle solver written in JAVA","archived":false,"fork":false,"pushed_at":"2015-07-24T11:18:04.000Z","size":136,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-05T03:27:30.475Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/cdvel.png","metadata":{"files":{"readme":"Readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-07-24T11:15:38.000Z","updated_at":"2016-03-24T04:12:35.000Z","dependencies_parsed_at":"2022-09-17T15:02:02.073Z","dependency_job_id":null,"html_url":"https://github.com/cdvel/super-word-search","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/cdvel/super-word-search","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cdvel%2Fsuper-word-search","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cdvel%2Fsuper-word-search/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cdvel%2Fsuper-word-search/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cdvel%2Fsuper-word-search/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/cdvel","download_url":"https://codeload.github.com/cdvel/super-word-search/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cdvel%2Fsuper-word-search/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260629702,"owners_count":23038972,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-04-05T03:27:31.087Z","updated_at":"2025-06-18T20:35:16.771Z","avatar_url":"https://github.com/cdvel.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"#Super word search\n# Introduction\nIn a typical word search puzzle (http://en.wikipedia.org/wiki/Word_search), you are given an NxM grid of\nseemingly random letters and a list of P words that are in the grid. The words can be found going in any\nof the 8 directions in a two dimensional grid:\n\n- top to bottom\n- bottom to top\n- left to right\n- right to left\n- bottom left to top right\n- bottom right to top left\n- top left to bottom right\n- top right to bottom left\n\nYou're a college professor (for English and Topology, of all things), and your students have become very\ngood at traditional Word Search. Since you want them to continue spending time on academic games,\nyou created a variant of Word Search (inventively) called Super Word Search.\nThe rules of the game\nAs with with standard word search, you get an NxM grid of letters, and P words that are to be found in\nthe grid. You also get a \"mode\" flag with one of the following values: WRAP, NO_WRAP. The flag value\nindicates whether words can wrap-around after they hit a boundary of the grid.\nRow numbers start at 0 (top row) and go to N-1 (bottom row). Column numbers start at 0 (leftmost\ncolumn) and go to M-1 (rightmost column). Grid coordinates are specified as (row_num, column_num).\nHere is an example to illustrate the difference between WRAP and NO_WRAP:\n\n\t  012\n\t0|ABC\n\t1|DEF\n\t2|GHI\n\nIf we are in WRAP mode:\n- \"FED\" is a word that starts at (1,2) and ends at (1,0).\n- \"CAB\" is a word that starts at (0,2) and ends at (0,1).\n- \"GAD\" is a word that starts at (2,0) and ends at (1,0).\n- \"BID\" is a word that starts at (0,1) and ends at (1,0).\nIf we are in NO_WRAP mode:\n- \"FED\" is a word that starts at (1,2) and ends at (1,0).\n- \"CAB\" is not a word since it requires wrapping in the horizontal direction.\n- \"GAD\" is not a word since it requires wrapping in the vertical direction.\n- \"BID\" is not a word since it requires wrapping in the horizontal and vertical directions.\n\nA letter in the grid is not allowed to be in a word more than once. So, while technically \"HIGH\" can be\nfound in the above grid in WRAP mode, we will not allow it because it uses the H at (2,1) twice.\nInput Format\n\n\tN M\n\tN rows of M letters\n\t\"WRAP\" or \"NO_WRAP\"\n\tP\n\tP words with 1 word per lines\n\nYour program should accept the name of an input file which will contains data in the above format.\nOutput Format\nFor each of the P words, you are to output the start and end coordinates of that word in the\nformat \"(row_start, column_start) (row_end, column_end)\". If the word cannot be found in the grid,\noutput \"NOT FOUND\".\n\nYou are guaranteed that each word will occur at most once in the grid, so a word's start and end\ncoordinates will always be unique (if the word is in the grid), and will never be ambiguous.\nYour program can write its output to the screen/console.\n\n### Examples\n\n*Input* \n\n\t3 3\n\tABC\n\tDEF\n\tGHI\n\tNO_WRAP\n\t5\n\tFED\n\tCAB\n\tGAD\n\tBID\n\tHIGH\n\n*Output*\n\n\t(1,2) (1,0)\n\tNOT FOUND\n\tNOT FOUND\n\tNOT FOUND\n\tNOT FOUND\n\n*Input*\n\n\t3 3\n\tABC\n\tDEF\n\tGHI\n\tWRAP\n\t5\n\tFED\n\tCAB\n\tGAD\n\tBID\n\tHIGH\n\n*Output*\n\n\t(1,2) (1,0)\n\t(0,2) (0,1)\n\t(2,0) (1,0)\n\t(0,1) (1,0)\n\tNOT FOUND","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcdvel%2Fsuper-word-search","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcdvel%2Fsuper-word-search","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcdvel%2Fsuper-word-search/lists"}