===================================================================== AI-9 Group-1 Sep Oct Nov total average Monday 08:10-11:20 01 15 29 13 27 10 points points => result --------------------------------------------------------------------- Oxremyuk Danil 2.5 3.5 3 -@ 9 /3 => Kurgan Andrey 2.5 5 3.5 - 11 /3 => Medvedskij Konstantin 2.5* 4 5 4 11.5 /3 => Begeza Konstantin - - - - 0 /3 => Mixno Egor 3.5* 3.5 2.5 3 9.5 /3 => Karinkov Anatolij 2.5 2.5 2.5 2.5 7.5 /3 => Radkovich Andrej - 3.5 3 3.5 6.5 /3 => Shumuk Alexandr 2.5 2.5 2.5 2.5 7.5 /3 => *--------------------------------------------------------------------- (1) All One Problem with "1" and "0" both 50 % (2) Minimization of Rustrigin function -5 < x_i < 5 in 20-D and 2-D (3) TSP with N=4,5,6,7... random location in (0,0)-(1000,1000) - create coordinates of N cities at random => calculat distance matrix => calculate distance of all the possible tours and pick up shortest one => when found N is almost too big to do the above try with evolution! (4) Lucky dog for 4 sausages at (200,200),(200,800),(800,800),(800,200) with (i) Fitness Share and/or (ii) Crowding ------------------------------------ *=>09/08;@=>10/13 too late to be allowed ========================================================================================== AI-9 Group-2 Sep Oct Nov total average Monday 08:10-11:20 08 22 06 20 03 17 points points => result ------------------------------------------------------------------------------------------ Borisyuk Sergej 2.5 4 2.5 2 9 /3 => Dashkevich Aleksandr 2.5 4 2.5 - 9 /3 => Kozeko Elena 4.5 5 5 4.5 14.5 /3 => Kontsevich Bladislav - 5 3 - 8 /2 => Kuznetsov Aleksandr 4 4.5 5 o <= pending 13.5 /3 => Trofimuk Artyom 2.5 2.5 2.5 - 7.5 /3 => Lavrenyuk Maksim 4.5 - 5 4 9.5 /2 => Shamshur Andrej 4.2 4.5 2.5 2.5 11.2 /3 => Pokalo Sergej - 2.5 2.5 - 5 /2 => ------------------------------------------------------------------------------------------ (1) All One Problem with "1" being 20 %; then 1% still have time (2) Lucky Dog: dogs start with (500,500) looking for one sausage at (200,800) in the troidal field (0,0)-(1000,1000) (3) y=sin^6(5*pi*x) with (i) Fitness Sharing or (ii) Crowding algorithm (4) Iterated Prisonner's Dilemma (IPD): The best evolved chromosome vs. (i) Random, (ii) Always Yes, (iii) Always No, and (iv) Tit-for-Tat Show fitness-generation 4 example game above with 12 innings with 1st 3 games being random =========================================================================================== Охремюк Даниил Павлович Борисюк Сергей Юрьевич Курган Андрей Михайлович Дашкевич Александр Игоревич Медведский Константин Игоревич Козеко Елена Леонидовна Бегеза Константин Игоревич Концевич Владислав Анатольевич Михно Егор Владиславович Кузнецов Александр Борисович Карников Анатолий Валентинович Трофимук Артём Игоревич Радкович Андрей Сергеевич Лавренюк Максим Александровичa Шумик Александр Сергеевич Шамшур Андрей Эдуардович Покало Сергей Сергеевич =====================================================================