I implemented a program using both Depth-First Search and A* Search to solve the Hua Rong Dao puzzle. I have considered the variant of the puzzle with 4 kinds of pieces: 1 2x2 piece; 5 1x2 pieces and 4 1x1 pieces. The goal is to find the sequence of moves that results in the least piece moves for the 2x2 piece to be above the bottom opening.
active 2023-09-20 → 2023-09-20 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2023-09-20 to 2023-09-20. Pushes: 1 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| christopheradolphe | 1 | 1 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.