Refactoring Day 14 to use entropy to find the least random configuration of points to detect the tree

jwcarman · jwcarman · commit aa0fe6a47c2e · 2024-12-18T23:15:06.000-05:00
diff --git a/src/main/kotlin/adventofcode/day14/RestroomRedoubt.kt b/src/main/kotlin/adventofcode/day14/RestroomRedoubt.kt
@@ -88,6 +88,7 @@ fun List<Point2D>.calculateShannonEntropy(maxX: Int, maxY: Int, gridWidth: Int,
 
     val totalPoints = size.toDouble()
     return histogram.values
+        .asSequence()
         .map { it / totalPoints }
         .sumOf { -it * ln(it) }
 }

Original file line number	Diff line number	Diff line change
`@@ -88,6 +88,7 @@ fun List<Point2D>.calculateShannonEntropy(maxX: Int, maxY: Int, gridWidth: Int,`
`88`	`88`
`89`	`89`	`val totalPoints = size.toDouble()`
`90`	`90`	`return histogram.values`
	`91`	`+ .asSequence()`
`91`	`92`	`.map { it / totalPoints }`
`92`	`93`	`.sumOf { -it * ln(it) }`
`93`	`94`	`}`