{"id":39732417,"url":"https://github.com/serhalp/hexymon","last_synced_at":"2026-01-18T11:01:33.979Z","repository":{"id":330914838,"uuid":"1124410486","full_name":"serhalp/hexymon","owner":"serhalp","description":"Daily linguistic puzzle game: find the shortest etymological path between two words","archived":false,"fork":false,"pushed_at":"2025-12-30T03:56:23.000Z","size":1673,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2026-01-08T13:15:56.517Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Svelte","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/serhalp.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":"AGENTS.md","dco":null,"cla":null}},"created_at":"2025-12-29T01:19:37.000Z","updated_at":"2025-12-30T03:56:26.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/serhalp/hexymon","commit_stats":null,"previous_names":["serhalp/hexymon"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/serhalp/hexymon","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/serhalp%2Fhexymon","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/serhalp%2Fhexymon/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/serhalp%2Fhexymon/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/serhalp%2Fhexymon/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/serhalp","download_url":"https://codeload.github.com/serhalp/hexymon/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/serhalp%2Fhexymon/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28535156,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-18T10:13:46.436Z","status":"ssl_error","status_checked_at":"2026-01-18T10:13:11.045Z","response_time":98,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":"2026-01-18T11:01:33.677Z","updated_at":"2026-01-18T11:01:33.973Z","avatar_url":"https://github.com/serhalp.png","language":"Svelte","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Hexymon\n\nSix degrees of etymological separation.\n\nHexymon is a daily linguistic puzzle game where players connect a start word to a target word by traversing an etymological graph. The gameplay mechanic resembles a word ladder, but operates on valid linguistic relationships (ancestry, descent, borrowing) rather than spelling changes.\n\n![Hexymon Gameplay Screenshot](https://placehold.co/800x450/e0e7ff/312e81?text=Hexymon+Gameplay)\n\n## Data and Attribution\n\n- Core etymology data comes from **EtymoLink: A Structured English Etymology Dataset** (Gao \u0026 Sun, 2024), ACL 2024. DOI: 10.18653/v1/2024.lchange-1.12.\n- Dataset repository: https://github.com/yuan-w-gao/etymolink\n- If you use this data, please cite the paper (see above DOI).\n\n## Gameplay\n\nThe objective is to connect the Start Word (top) to the Target Word (bottom).\n\n- **Input**: Players use a search input to find and select words.\n- **Pathing**:\n  - **The Perfect Path**: Words belonging to the specific daily puzzle path snap into the main hexagonal chain.\n  - **Constraints**: The **Language** label on empty slots acts as a constraint. If multiple valid paths exist, these hints define which one is the \"correct\" solution.\n  - **Branching**: Valid words that are related but not on the target path appear as branches (detours).\n- **Hints**: Empty nodes display the language of the target word.\n- **Constraints**: Players have 6 \"lives\". An incorrect guess consumes a life but reveals a Part of Speech hint for one of the unrevealed nodes on the optimal path.\n\n## Contributing\n\nThis project uses [SvelteKit](https://svelte.dev/docs/kit/introduction) and is deployed to [Netlify](https://www.netlify.com/).\n\nFor documentation on the architecture, local development setup, and code standards, please refer to [CONTRIBUTING.md](CONTRIBUTING.md).\n\n## License\n\nMIT\n\n## Funding\n\nI made this for fun. If you like it, please consider donating to a local food bank.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fserhalp%2Fhexymon","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fserhalp%2Fhexymon","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fserhalp%2Fhexymon/lists"}