{"id":22877342,"url":"https://github.com/rqbazan/robot-car","last_synced_at":"2025-03-31T13:40:38.011Z","repository":{"id":102304537,"uuid":"80230594","full_name":"rqbazan/robot-car","owner":"rqbazan","description":"🚘 Problema creado para CodeSignal (antes CodeFights) https://app.codesignal.com/challenge/3YnBhK4tTZs8fAguL","archived":false,"fork":false,"pushed_at":"2017-11-25T03:35:14.000Z","size":158,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-06T19:52:07.613Z","etag":null,"topics":["challenging-algorithms","codefights","graph","programming","python"],"latest_commit_sha":null,"homepage":"","language":"Python","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/rqbazan.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-01-27T17:41:37.000Z","updated_at":"2021-11-07T23:27:27.000Z","dependencies_parsed_at":null,"dependency_job_id":"f7904e41-a352-46e6-a45f-b9a55bd68d3b","html_url":"https://github.com/rqbazan/robot-car","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rqbazan%2Frobot-car","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rqbazan%2Frobot-car/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rqbazan%2Frobot-car/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rqbazan%2Frobot-car/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rqbazan","download_url":"https://codeload.github.com/rqbazan/robot-car/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246475796,"owners_count":20783725,"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":["challenging-algorithms","codefights","graph","programming","python"],"created_at":"2024-12-13T15:34:02.303Z","updated_at":"2025-03-31T13:40:37.983Z","avatar_url":"https://github.com/rqbazan.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# RobotCar!\nSe le presenta un escenario en donde usted tendrá que programar un carro seguidor de líneas; el cual será capaz de trasladarse desde un punto hacia otro, dentro del laberinto que se muestra a continuación:\n\n\u003cp align=\"center\"\u003e\n  \u003cimg src=\"https://raw.githubusercontent.com/rqbazan/RobotCar/master/images/redmaze.gif\"/\u003e\n\u003c/p\u003e\n\nEl robot solo puede moverse por las lineas rojas. Aqui esta la leyenda del laberinto:\n\n* Los pequeños circulos negros representan las intersecciones, donde el carro se detiene para decidir su siguiente movimiento.\n* El punto morado siempre será la posición inicial del robot.\n* Los circulos verdes son posibles puntos de visita.\n\nEn cada punto el robot tiene que decidir una de tres opciones:\n\n* `\" F \"`: avanzar.\n* `\" R \"`: moverse hacia la derecha.\n* `\" L \"`: moverse hacia la izquierda.\n\nUsted puede asumir que el robot siempre realiza un giro de 180° cada vez que llega a un punto de visita, listo para salir en busca de otro.\n\n\u003e Basado en el examen final del curso ARQCO, Por el Ing. Bady Cruz Diaz.\n\n**Entrada:**\n\n\u003e Una lista **L** con puntos de visita del laberinto, a los que el carro deberá trasladarse en orden. `1 \u003c= | L | \u003c= 7` \n\n**Salida:**\n\n\u003e Un string con las deciciones que el robot debe realizar para visitar todos los punto en **L**, separada por simbolos `'-'`.\n\n**Ejemplos:**\n\n* `RobotCar([[4, 2], [5, 5]]) = \"F-R-F-R-R-R-R-F-L-L-F-L-R-R\"`\n* `RobotCar([[0, 0]])         = \"F-R-L-F-L-L-R-R\"`\n* `RobotCar([[2, 3], [0, 5]]) = \"F-R-L-F-R-R-R-F-F-L\"`\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frqbazan%2Frobot-car","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frqbazan%2Frobot-car","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frqbazan%2Frobot-car/lists"}