-
Notifications
You must be signed in to change notification settings - Fork 1
/
Program.cs
115 lines (96 loc) · 2.77 KB
/
Program.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
using AdventOfCode._2021_23;
static int FindLowestEnergyCost(AmphipodWorld startWorld, AmphipodWorld finishedWorld)
{
Console.WriteLine("Searching from");
Console.WriteLine(startWorld);
// Dijkstra
var queue = new PriorityQueue<AmphipodWorld, int>();
queue.Enqueue(startWorld, 0);
var lowestEnergies = new Dictionary<int, int>
{
[startWorld.GetHashCode()] = 0
};
var previousWorld = new Dictionary<int, (AmphipodWorld, int)>();
while (queue.Count > 0)
{
var current = queue.Dequeue();
var currentEnergy = lowestEnergies[current.GetHashCode()];
foreach (var move in current.GetPossibleMoves())
{
var hash = move.World.GetHashCode();
if (!lowestEnergies.TryGetValue(hash, out var neighbourEnergy))
{
neighbourEnergy = int.MaxValue;
}
var newEnergy = currentEnergy + move.EnergyCost;
if (newEnergy < neighbourEnergy)
{
lowestEnergies[hash] = newEnergy;
queue.Enqueue(move.World, newEnergy);
previousWorld[hash] = (current, currentEnergy);
}
}
}
var currentHash = finishedWorld.GetHashCode();
if (!lowestEnergies.TryGetValue(currentHash, out var result))
{
Console.WriteLine("Failed to find the moves to reach the desired state!");
return -1;
}
var start = startWorld.GetHashCode();
var moves = new List<(AmphipodWorld, int)>();
while (currentHash != start)
{
moves.Add(previousWorld[currentHash]);
currentHash = previousWorld[currentHash].Item1.GetHashCode();
}
// Print the winning sequence
int i = 1;
foreach (var w in moves.Reverse<(AmphipodWorld, int)>())
{
Console.WriteLine($"{i++}# - {w.Item2}:");
Console.WriteLine(w.Item1);
}
Console.WriteLine(result);
Console.WriteLine(finishedWorld);
return result;
}
var startWorld = new AmphipodWorld(new[]
{
"#############",
"#...........#",
"###B#A#B#C###",
" #C#D#D#A#",
" #########"
});
var endWorld = new AmphipodWorld(new[]
{
"#############",
"#...........#",
"###A#B#C#D###",
" #A#B#C#D#",
" #########"
});
Console.WriteLine($"Part 1: " + FindLowestEnergyCost(startWorld, endWorld));
Console.WriteLine();
startWorld = new AmphipodWorld(new[]
{
"#############",
"#...........#",
"###B#A#B#C###",
" #D#C#B#A#",
" #D#B#A#C#",
" #C#D#D#A#",
" #########",
});
endWorld = new AmphipodWorld(new[]
{
"#############",
"#...........#",
"###A#B#C#D###",
" #A#B#C#D#",
" #A#B#C#D#",
" #A#B#C#D#",
" #########"
});
Console.WriteLine($"Part 2: " + FindLowestEnergyCost(startWorld, endWorld));