{"id":29192431,"url":"https://github.com/analiaburgosdev/java_backtracking_atila-s-horse","last_synced_at":"2025-07-02T01:31:08.631Z","repository":{"id":284456642,"uuid":"955008985","full_name":"analiaBurgosDev/java_backtracking_Atila-s-Horse","owner":"analiaBurgosDev","description":"Atila's Horse","archived":false,"fork":false,"pushed_at":"2025-03-26T00:57:27.000Z","size":8,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-11T23:41:36.484Z","etag":null,"topics":["backtracking-algorithm","java"],"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/analiaBurgosDev.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":"2025-03-26T00:54:29.000Z","updated_at":"2025-03-31T21:45:08.000Z","dependencies_parsed_at":"2025-03-26T01:35:41.405Z","dependency_job_id":"051087f0-fe16-4e3f-bda8-9bd91846ba89","html_url":"https://github.com/analiaBurgosDev/java_backtracking_Atila-s-Horse","commit_stats":null,"previous_names":["ayvero/java_backtracking_atila-s-horse","analiaburgosdev/java_backtracking_atila-s-horse"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/analiaBurgosDev/java_backtracking_Atila-s-Horse","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_backtracking_Atila-s-Horse","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_backtracking_Atila-s-Horse/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_backtracking_Atila-s-Horse/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_backtracking_Atila-s-Horse/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/analiaBurgosDev","download_url":"https://codeload.github.com/analiaBurgosDev/java_backtracking_Atila-s-Horse/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_backtracking_Atila-s-Horse/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263059545,"owners_count":23407378,"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":["backtracking-algorithm","java"],"created_at":"2025-07-02T01:30:45.680Z","updated_at":"2025-07-02T01:31:08.606Z","avatar_url":"https://github.com/analiaBurgosDev.png","language":"Java","readme":"#  El Caballo de Atila\n\n## Descripción del Problema\nEn este ejercicio, se debe deducir el recorrido completo realizado por el caballo de Atila en un jardín de n x n casillas. El caballo comenzó en una casilla aleatoria, realizó un recorrido cerrado sin pisar dos veces la misma casilla y se movió solo en direcciones horizontales o verticales (nunca en diagonal). El pasto en las casillas que el caballo visitó nunca volvió a crecer.\n\n## Enfoque\n- **Backtracking**: El algoritmo utiliza técnicas de backtracking y búsqueda en profundidad (DFS) para explorar la matriz, manteniendo un registro de las casillas visitadas y deduciendo los posibles caminos.\n- **Navegación en la Matriz**: El problema consiste en navegar por una matriz asegurando que ninguna casilla sea visitada más de una vez, usando solo movimientos horizontales y verticales.\n\n## Aplicaciones\nEste ejercicio es útil para problemas de recorrido y trazado de rutas en gráficos y matrices, aplicable en áreas como robótica, videojuegos y optimización de trayectorias en sistemas logísticos.\n\n------------------------------------------------------\n\n# Atila's Horse\n\n## Problem Description\nIn this exercise, we need to deduce the complete path taken by Atila's horse on a garden grid of size n x n. The horse started at any random cell, made a closed loop without revisiting any cell, and moved only in horizontal or vertical directions (never diagonally). The grass in the cells the horse visited will never grow back.\n\n## Approach\n- **Backtracking**: The algorithm uses backtracking and depth-first search (DFS) to explore the grid, keeping track of visited cells and deducing possible paths.\n- **Grid Navigation**: The problem involves navigating a grid while ensuring no cell is visited more than once, using only horizontal and vertical moves.\n\n## Applications\nThis exercise is useful in problems related to pathfinding and route tracing in graphs and matrices, applicable to areas such as robotics, video games, and path optimization in logistical systems.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanaliaburgosdev%2Fjava_backtracking_atila-s-horse","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanaliaburgosdev%2Fjava_backtracking_atila-s-horse","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanaliaburgosdev%2Fjava_backtracking_atila-s-horse/lists"}