nikola/pairgoth
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 1 Wiki Activity

Write weights to standard output for debugging purposes

Browse Source
This commit is contained in:
Quentin Rendu
2023-09-26 08:47:58 +02:00
parent 9bddd90833
commit 7f50f9254c
2 changed files with 32 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
api-webapp/src/main/kotlin/org/jeudego/pairgoth/model/Pairable.kt
View File

@@ -70,7 +70,7 @@ class Player(
if (skip.isNotEmpty()) it["skip"] = Json.Array(skip) if (skip.isNotEmpty()) it["skip"] = Json.Array(skip)
} }
override fun nameSeed(): String { override fun nameSeed(): String {
return name + firstname return name + " " + firstname
} }
} }

31
api-webapp/src/main/kotlin/org/jeudego/pairgoth/pairing/Solver.kt
View File

@@ -89,6 +89,22 @@ sealed class Solver(
pairing.secondary.apply(p1, p2) + pairing.secondary.apply(p1, p2) +
pairing.geo.apply(p1, p2) pairing.geo.apply(p1, p2)
fun weightsToFile(p1: Pairable, p2: Pairable) {
val pos1: Int = logSortedPairablesMap[p1]!!
val pos2: Int = logSortedPairablesMap[p2]!!
//println("Player1Name="+p1.nameSeed())
//println("Player2Name="+p2.nameSeed())
//println("total: "+weightLogs["total"]!![pos1][pos2])
//println("total: "+weightLogs["total"]!![pos1][pos2])
// println(DEBUG_EXPORT_WEIGHT)
//println(weightLogs["tot"]!![pos1][pos2])
//println(p1)
//println(p2)
//println(weight)
}
// The main criterion that will be used to define the groups should be defined by subclasses // The main criterion that will be used to define the groups should be defined by subclasses
val Pairable.main: Double get() = scores[id] ?: 0.0 val Pairable.main: Double get() = scores[id] ?: 0.0
abstract val mainLimits: Pair<Double, Double> abstract val mainLimits: Pair<Double, Double>
@@ -104,6 +120,20 @@ sealed class Solver(
val q = pairables[j] val q = pairables[j]
weight(p, q).let { if (it != Double.NaN) builder.addEdge(p, q, it) } weight(p, q).let { if (it != Double.NaN) builder.addEdge(p, q, it) }
weight(q, p).let { if (it != Double.NaN) builder.addEdge(q, p, it) } weight(q, p).let { if (it != Double.NaN) builder.addEdge(q, p, it) }
if (DEBUG_EXPORT_WEIGHT)
{
println("Player1Name="+p.nameSeed())
println("Player2Name="+q.nameSeed())
println("BaseCost="+pairing.base.apply(p, q).toString())
println("MainCost="+pairing.main.apply(p, q).toString())
println("SecoCost="+pairing.secondary.apply(p, q).toString())
println("Geo_Cost="+pairing.geo.apply(p, q).toString())
println("Sum_Cost="+weight(p,q).toString())
//println(weight(q,p))
logWeights("total", p, q, weight(p,q))
//weightsToFile(p, q)
//println("total weight="+weight(p, q))
}
} }
} }
val graph = builder.build() val graph = builder.build()
@@ -125,6 +155,7 @@ sealed class Solver(
val pos1: Int = logSortedPairablesMap[p1]!! val pos1: Int = logSortedPairablesMap[p1]!!
val pos2: Int = logSortedPairablesMap[p2]!! val pos2: Int = logSortedPairablesMap[p2]!!
weightLogs[weightName]!![pos1][pos2] = weight weightLogs[weightName]!![pos1][pos2] = weight
} }
} }