https://github.com/ayvero/java_backtracking_4x4-board
The goal of this exercise is to solve a sorting problem on a 4x4 board where numbers from 1 to 15 are randomly placed, and one tile is empty. The task is to determine a sequence of moves to swap adjacent numbers (horizontally or vertically) with the empty tile so that the numbers are arranged in order and the empty tile ends up at position (4,4).
https://github.com/ayvero/java_backtracking_4x4-board
backtracking-algorithm java
Last synced: 7 months ago
JSON representation
The goal of this exercise is to solve a sorting problem on a 4x4 board where numbers from 1 to 15 are randomly placed, and one tile is empty. The task is to determine a sequence of moves to swap adjacent numbers (horizontally or vertically) with the empty tile so that the numbers are arranged in order and the empty tile ends up at position (4,4).
- Host: GitHub
- URL: https://github.com/ayvero/java_backtracking_4x4-board
- Owner: Ayvero
- Created: 2025-03-26T21:21:12.000Z (7 months ago)
- Default Branch: main
- Last Pushed: 2025-03-26T21:25:03.000Z (7 months ago)
- Last Synced: 2025-03-26T22:27:46.714Z (7 months ago)
- Topics: backtracking-algorithm, java
- Language: Java
- Homepage:
- Size: 5.86 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Ordenar Tablero 4x4
## Descripción del Problema
El objetivo de este ejercicio es resolver un problema de ordenamiento en un tablero de 4x4, donde los números del 1 al 15 están ubicados de forma desordenada y hay una casilla vacía. Se debe determinar una secuencia de movimientos intercambiando números contiguos (horizontal y verticalmente) con la casilla vacía, de manera que los números queden ordenados y la casilla vacía termine en la posición (4,4).
## Enfoque
- **Algoritmos de Búsqueda**: Implementación de algoritmos como A* o Búsqueda en Anchura (BFS) para encontrar la secuencia óptima de movimientos.
- **Gestión de Estados**: Seguimiento de las configuraciones del tablero y exploración sistemática de posibles movimientos.
## Aplicaciones
Este problema es útil en la resolución de puzzles y optimización en búsqueda y planificación. También tiene aplicaciones en inteligencia artificial para la resolución de problemas de estado y transición.
----------------------------------
# Sorting a 4x4 Board
## Problem Description
The goal of this exercise is to solve a sorting problem on a 4x4 board where numbers from 1 to 15 are randomly placed, and one tile is empty. The task is to determine a sequence of moves to swap adjacent numbers (horizontally or vertically) with the empty tile so that the numbers are arranged in order and the empty tile ends up at position (4,4).
## Approach
- **Search Algorithms**: Implementing algorithms such as A* search or Breadth-First Search (BFS) to efficiently find the optimal sequence of moves.
- **State Management**: Tracking board configurations and exploring possible moves in a systematic manner.
## Applications
This problem is relevant for puzzle-solving algorithms and optimization in search and planning. It also has applications in artificial intelligence, specifically in state-space search and transition management.