Problem 58444. ICFP 2022 - True Optimal RGB for a region
The ICFP2023 Challenge is Jul 7-10, registraion opens late June. Updates at TwitICFP2023. These contests are insanely complicated and competitive. The challenge evolves every 12 hours with new files and rule updates.
The ICFP2022 HomePage has details of the RoboPaint contest. Twit2022, WriteUps, PriorEvents, Spec, ImageSubmissions, Puzzles, SawickiSolutions are useful links. Posted 6/20/23.
This challenge of True Optimal RGB is addressed in detail by RGB Team or wiki Weiszfeld's Algotithm. A hill climbing approach of best adjacent rgb is claimed to achieve True Optimal.
This challenge is to return True Optimal [r g b] sets for a given image region input [M N 3].Four regions of 21.png will be provided and the total score will be evaluated. The score must be less than 99360 to Pass. A scoring function is provided in the template. Score: Alpha*sum(pixel_color_dist). Case 2: 11.png is treated as a single region. Score<= 72990.
The output for each block region is a vector rgb=[r g b].
Solution CommentsShow comments
Problem Recent Solvers1