-
-
Notifications
You must be signed in to change notification settings - Fork 58
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
4 additions
and
4 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,11 +1,11 @@ | ||
## --- Day 4: Ceres Search --- | ||
"Looks like the Chief's not here. Next!" One of The Historians pulls out a device and pushes the only button on it. After a brief flash, you recognize the interior of the __Ceres monitoring station__! | ||
As the search for the Chief continues, a small Elf who lives on the station tugs on your shirt; she'd like to know if you could help her with her <em>word search</em> (your puzzle input). She only has to find one word: <code>XMAS</code>. | ||
As the search for the Chief continues, a small Elf who lives on the station tugs on your shirt; she'd like to know if you could help her with her <em>word search</em>. She only has to find one word: <code>XMAS</code>. | ||
|
||
Read the [full puzzle](https://adventofcode.com/2024/day/4). | ||
|
||
I used my proven tactic and converted the input to a Dictionary keyed by coordinates. It's easy to iterate over the keys and checking if we are in the bounds of the map as well. | ||
I employed my proven tactic of converting the input into a dictionary, using coordinates as keys. This approach makes it straightforward to iterate over the keys and check whether they fall within the bounds of the map. | ||
|
||
Representing the coordinates with Complex numbers is also a useful way to deal with stepping in various directions. | ||
Representing coordinates with complex numbers is another effective technique for handling steps in various directions. | ||
|
||
The algorithm itself is simply a bruteforce check of all starting positions and reading orders. | ||
The algorithm itself is a straightforward brute-force check of all starting positions and reading orders. |