Model solution for minContainingHexagon in lesson8.task1 is incorrect

[AbdullinAM]

Some test cases:

val pts = "-557.-557, 617.-557, -558.-999, -107.-965, -1000.-483, -557.-1000, -557.-558".split(", ").map {
    val (first, second) = it.split(".")
    HexPoint(first.toInt(), second.toInt())
}.toTypedArray()

Model solution gives a hexagon with radius 1030. But in fact there is possible to build a hexagon with radius 809 and center (-556.-192), that will satisfy the task condition.

More examples:

[-741.-558, 465.-329, 520.-1000, 347.-1000, -433.-557, -668.-558, 20.-57, -558.591, -74.-558, -999.-557, 455.-286, -558.-1000, -81.-557, -595.-557, -557.-153, -557.523]
Best solution r=890, model solution r=925

[-557.-557, -266.-1000, -518.-1000, -999.-999, -999.-325, -1000.582]
Best solution r=791, model solution r=916

[mglukhikh]

Will try to investigate and solve the problem till 15 November :(

[mglukhikh]

Some critical issues fixed (not all of them). Now student solution passes test if its radius is the same or less than given in model solution.

[mglukhikh]

At this moment first and third examples are fixed. Second is still wrong, and we still have sub-optimal solution only.