{"id":19664561,"url":"https://github.com/sancakerkan/schemepathsolver","last_synced_at":"2026-02-08T04:34:05.912Z","repository":{"id":243757650,"uuid":"805736814","full_name":"sancakerkan/SchemePathSolver","owner":"sancakerkan","description":"Welcome to Scheme Path Solver, a simple program written in Scheme that helps you navigate through paths represented in a grid layout.","archived":false,"fork":false,"pushed_at":"2024-08-01T23:57:03.000Z","size":188,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-27T12:41:21.748Z","etag":null,"topics":["drracket","lisp","racket","scheme"],"latest_commit_sha":null,"homepage":"","language":"Racket","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sancakerkan.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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}},"created_at":"2024-05-25T10:16:14.000Z","updated_at":"2024-08-01T23:57:06.000Z","dependencies_parsed_at":"2024-06-11T02:32:02.088Z","dependency_job_id":"754a1d01-fe14-4d86-ade0-4f07cbaa216c","html_url":"https://github.com/sancakerkan/SchemePathSolver","commit_stats":null,"previous_names":["sancakerkan/schemepathsolver"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sancakerkan/SchemePathSolver","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FSchemePathSolver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FSchemePathSolver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FSchemePathSolver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FSchemePathSolver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sancakerkan","download_url":"https://codeload.github.com/sancakerkan/SchemePathSolver/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sancakerkan%2FSchemePathSolver/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29220520,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-08T03:18:47.732Z","status":"ssl_error","status_checked_at":"2026-02-08T03:15:31.985Z","response_time":57,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5: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":["drracket","lisp","racket","scheme"],"created_at":"2024-11-11T16:18:06.408Z","updated_at":"2026-02-08T04:34:05.896Z","avatar_url":"https://github.com/sancakerkan.png","language":"Racket","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Scheme Path Solver 🧩\n![Scheme](https://img.shields.io/badge/Scheme-005A72?style=for-the-badge\u0026logo=scheme\u0026logoColor=white)\n![Racket](https://img.shields.io/badge/Racket-3C6F8C?style=for-the-badge\u0026logo=racket\u0026logoColor=white)\n![GitHub](https://img.shields.io/badge/GitHub-100000?style=for-the-badge\u0026logo=github\u0026logoColor=white)\n![Build Status](https://img.shields.io/badge/build-passing-brightgreen)\n![Issues](https://img.shields.io/github/issues/sancakerkan/SchemePathSolver )\n![License: MIT](https://img.shields.io/badge/License-MIT-blue.svg)\n\n## Table of Contents\n\n- [Introduction](#introduction)\n- [Features](#features)\n- [Installation](#installation)\n- [Usage](#usage)\n- [How It Works](#how-it-works)\n- [Contributing](#contributing)\n- [License](#license)\n- [Acknowledgements](#acknowledgements)\n\n## Introduction\n\n**Scheme Path Solver** is a Scheme-based utility designed to navigate paths in a grid layout. The program calculates the sequence of movements needed to travel from a starting point to a finish point in a grid where black cells represent walls and white cells are navigable. The starting point is always at `[0,0]`, and the finish point is denoted by the letter 'F'.\n\n## Features\n\n- **Grid Dimensions:** Retrieve the grid’s height and width using `getHeight` and `getWidth` functions.\n- **Cell Content:** Access the letter at any grid position with the `getLetter` function.\n- **Path Solution:** Solve the path with the `solvePath` function, which returns a sequence of movements.\n\n## Installation\n\n### Prerequisites\n\n- Racket Scheme interpreter. Download it from [here](https://download.racket-lang.org/).\n\n### Cloning the Repository\n\n1. **Using Git:**\n    - Clone the repository using the following command:\n      ```bash\n      git clone https://github.com/sancakerkan/SchemePathSolver\n      ```\n    - Navigate to the project directory:\n      ```bash\n      cd SchemePathSolver \n      ```\n\n2. **Alternatively, Download ZIP:**\n    - [Download ZIP](https://github.com/sancakerkan/SchemePathSolver/archive/refs/heads/main.zip)\n\n## Usage\n\n### Running the Program\n\n1. **Using Racket:**\n    - Open the Racket IDE.\n    - Set the language to \"The Racket Language\".\n    - Open the file `src/PathSolver.rkt`.\n    - Run the program.\n\n## How It Works\n\nThe program provides a solution as a sequence of movements such as \"D D R R R R D D\". This sequence indicates movements down 2 times, right 4 times, and down 2 more times. The grid layout ensures that there is only one solution with a single possible move for each step.\n\n## Contributing\n\nWe welcome contributions to improve the project! To contribute:\n\n1. **Fork the Repository:** Create your own copy of the project.\n2. **Create a Branch:** Create a feature branch for your changes.\n3. **Make Changes:** Implement new features or fix bugs.\n4. **Submit a Pull Request:** Propose your changes to be merged.\n\n## License\n\nThis project is licensed under the MIT License. See the [LICENSE](LICENSE) file for more details.\n\n## Acknowledgements\n\n- Special thanks to **Elif Aysu Kürşad** and **Metehan Tüter** for their valuable contributions and support.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsancakerkan%2Fschemepathsolver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsancakerkan%2Fschemepathsolver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsancakerkan%2Fschemepathsolver/lists"}