ITSA Programming Challenge 2005 Gordon Pace, Joseph Cordina & Sandro Spina (the judges) Organisers Sponsors Problem setting.

Slides:



Advertisements
Similar presentations
Algorithm Design Techniques
Advertisements

Java Programming Session 2. Objectives To design a range of different blocks To create the code for these blocks To test that each block rotates correctly.
First Year Robotics Platform By: Andria Farnham, Adam Selinger, Curtis Langley.
ACM Programming Team Bill Punch. ACM Programming Contest One of the premier programming competitions. Held every year since 1977 MSU was the winner that.
Bin Packing First fit algorithm
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
Tetris and Genetic Algorithms Math Club 5/30/2011.
Code-Blocks THAR’15 If it’s bug free, it’s time to make changes.
Consensus problem Agreement. All processes that decide choose the same value. Termination. All non-faulty processes eventually decide. Validity. The common.
ORIGASMIQUE Problem setters and judges: Christian Colombo Jean Paul Ebejer Karl Fenech Gordon Pace Chris Porter.
ICTSA Programming Contest 2009 Legal Cheating in Elections Gordon Pace Claudia Borg Chris Porter.
What has the EU ever done for you? Well, share your views with us and you could present your views to MEPs and win a bike worth £250! YOUTH VOICE: EUROPE.
Multi-Source Shortest Paths T. Patrick Bailey CSC 5408 Graph Theory 4/28/2008.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
1 Genetic Algorithms. CS The Traditional Approach Ask an expert Adapt existing designs Trial and error.
CS 410 Applied Algorithms Applied Algorithms Lecture #1 Introduction, class information, first problems.
1 Genetic Algorithms. CS 561, Session 26 2 The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Routing 2 Outline –Maze Routing –Line Probe Routing –Channel Routing Goal –Understand maze routing –Understand line probe routing.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Genetic Programming System for Music Generation With Automated Fitness Raters.
Institute for Personal Robots in Education (IPRE)‏ CSC 170 Computing: Science and Creativity.
Entering our fourth year of the competition Stems from the Project.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
1 Local search and optimization Local search= use single current state and move to neighboring states. Advantages: –Use very little memory –Find often.
INTRODUCTION TO PROGRAMMING, ALGORITHMS & FLOWCHARTS Programming in C2 CHAPTER 1.
© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.
An Efficient Placement Strategy for Metaheuristics based Layout Optimization by Abdul-Rahim Ahmad Otman Basir Systems Design Engineering, University of.
Professional IT Roles Investigate IT professional roles. Find out what each role involves, what the job entails. Identify what personal qualities are needed.
Analysis of algorithms Analysis of algorithms is the branch of computer science that studies the performance of algorithms, especially their run time.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Lesson Objective: Understand what an algorithm is and be able to use them to solve a simple problem.
1/27 Discrete and Genetic Algorithms in Bioinformatics 許聞廉 中央研究院資訊所.
Fuzzy Genetic Algorithm
G5BAIM Artificial Intelligence Methods Dr. Rong Qu Evolutionary Algorithms.
DYNAMIC FACILITY LAYOUT : GENETIC ALGORITHM BASED MODEL
On the Approximability of Geometric and Geographic Generalization and the Min- Max Bin Covering Problem Michael T. Goodrich Dept. of Computer Science joint.
Genetic Algorithms Genetic algorithms provide an approach to learning that is based loosely on simulated evolution. Hypotheses are often described by bit.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
A Membrane Algorithm for the Min Storage problem Dipartimento di Informatica, Sistemistica e Comunicazione Università degli Studi di Milano – Bicocca WMC.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Machine Learning A Quick look Sources: Artificial Intelligence – Russell & Norvig Artifical Intelligence - Luger By: Héctor Muñoz-Avila.
The answer to the Long answered question from the test last week An activity that pushes you to your boundaries can stimulate physical challenge. An example.
Innovation Challenge How can the back to school shopping experience be made better?
HKOI Programming HKOI Training Team (Intermediate) Alan, Tam Siu Lung Unu, Tse Chi Yung.
C++ Programming: From Problem Analysis to Program Design, Fifth Edition Chapter 1: An Overview of Computers and Programming Languages.
Multi-cellular paradigm The molecular level can support self- replication (and self- repair). But we also need cells that can be designed to fit the specific.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Local search algorithms In many optimization problems, the path to the goal is irrelevant; the goal state itself is the solution State space = set of "complete"
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Advanced Higher Computing Science
Bin Packing First fit decreasing algorithm
Bin Packing First fit algorithm
Discrete Mathematics Algorithms.
Evolution strategies and genetic programming
Understand the Programming Process
Roadmap to Programming work, right, fast KISS

Comparing Genetic Algorithm and Guided Local Search Methods
Compiler Construction
Bin Packing First fit decreasing algorithm
Bin packing – First fit algorithm
Understand the Programming Process
Title slide: Intro to the workshop:
Bin Packing First fit decreasing algorithm
Bin Packing First fit decreasing algorithm
Bin Packing First fit algorithm
(team representative name here)
Presentation transcript:

ITSA Programming Challenge Gordon Pace, Joseph Cordina & Sandro Spina (the judges) Organisers Sponsors Problem setting and judging

The Competition 48 hour programming competition. Prizes for lightning & normal submissions. Fair problem, accessible to all programmers. Judging criteria are to be objective.

The problem Write a program which: Given a number of Tetris-like pieces … Rotate them and move them around so as to … Pack them into as small a rectangle as the program can.

An example Input Output

The Teams 8 teams registered, 5 submitting lightning solutions, 6 submitting standard submissions.

Farm Squad 4 Richard Vella Mark Chircop William Borg Barthet Matthew Felice Pace

Forever Young Mario Gauci Karl Cassar “… 1.First you find the smallest area in which the shapes fit (ex. 4x4). 2.Then you try to place the shapes in that area 3.If they fit stop as you have found the smallest area possible (using this algorithm). 4.Otherwise store your result and try again with a larger area. To fit the shapes to the area we tried to fit the shape that fits best to the border. Then the border take would also include the outline of the border.”

HyperDonkeys Marco Muscat, Jonathan Caruana, Neville Grech, Stephen Fenech & Alan Cassar “All the shapes are queued in a random order and a placing algorithm will place them in the best way possible in that given order. The placing algorithm considers all rotations of every shape and places them on the top and right hand side of the first shape. To optimise the results the placing algorithm is placed in a genetic algorithm that alters and tries to optimise the order of the blocks, using crossovers and mutations that span over a number of generations.” “We used C# to code the solution.”

Team A Gaetano Caruana & Jimmy Borg “indunajna li kien difficli immens li niddecifraw u namlu hard coded sort of l-moves li jridu jsiru. Ghaldaqstant morna al AI technique.....Genetic Algorithm. Basikament ikollok popolzjaoni ta solutions u min dik l-popoluzjoni jkolli giex operations mutation u crossovers. Permezz ta dawn l-operations l-popolazjoni dejjem sort of timmatura u permezz ta’ hekk is-solution l-iktar fit tirbah. F’dan l-kaz l-iktar fit hija s-soluzjoni bl inqas area u bl izghar sides possibli”

Team1337 David Bailey & Ruth Schembri “We tried to place shapes on top of each other and fit them together by moving them around in a spiral and rotating all the time … but we had to change the idea drastically on Sunday” Used Borland Delphi “because of its ease of use but fast compiling and code execution”.

X3M Carmelo Ebejer & Chris Grech “We spent quite some time thinking of optimisations to reduce the complexity of the problem. After that, our main concern was choosing a suitable programming language. We chose C# over C, C++ or Pascal because of quicker development time.”

The Judging 10 preset problems. Available from the beginning but in encrypted form. Programs ranked according to size of the smallest bounding rectangle: best (smallest) 50 points, second 30 points, third 20 points, fourth 10 points and fifth 5 points. In case of overall tie, other rules were given but were not needed.

Judging Problem 07

Teams HyperDonkeys, Farm Squad 4 and X3M produced (almost) identical optimal layouts.

Judging Problem 07 Even if the other teams were rather creative. Team 1337 Team A Forever Young

Judging Problem 02

Teams X3M and Forever Young produced a(n almost identical) list of queuing Ls.

Judging Problem 02 Teams Team1337 and Team A were more creative.

Judging Problem 02 Teams Farm Squad 4 and HyperDonkeys managed to identify an optimal packing!

Judging Problem 10

Judging Problem 07 Teams HyperDonkeys, Farm Squad 4 and X3M all produced an optimal layout.

Judging Problem 07 Again, the other teams were rather creative. Team 1337 Team A Forever Young

But before the results, we will have a short Intermission

Sending ITSA Packing

Team x8 X3M 11x5 Team A 8x10 Forever Young 12x5 Farm Squad 4 3x18 HyperDonkeys 7x7

And now … the results!

Lightning Round 5 participating teams: Farm Squad 4 Forever Young HyperDonkeys Team A Team1337

Overall Results: Lightning Problem 1: 1. HyperDonkeys 2. Team A 3. Team Forever Young

Overall Results: Lightning Problem 2: 1. Farm Squad 4 2. Team A 3. Team1337

Overall Results: Lightning Problem 3: 1.Farm Squad 4 2.HyperDonkeys 3.Team A 4.Team1337

Overall Results: Lightning Problem 4: 1.Team A 2.HyperDonkeys 3.Team Forever Young

Overall Results: Lightning Problem 5: 1.Farm Squad 4 2.Team A 3.Team1337

Overall Results: Lightning Problem 6: 1.HyperDonkeys 2.Team A 3.Farm Squad 4 4.Team1337

Overall Results: Lightning Problem 7: 1.Farm Squad 4, HyperDonkeys 2.Team A 3.Forever Young 4.Team1337

Overall Results: Lightning Problem 8: 1.HyperDonkeys 2.Team A 3.Forever Young 4.Team1337

Overall Results: Lightning Problem 9: 1.Forever Young, Farm Squad 4, HyperDonkeys 2.Team A 3.Team1337

Overall Results: Lightning Problem 10: 1.Farm Squad 4, HyperDonkeys 2.Team A 3.Forever Young 4.Team1337

The Ranking

Lightning Results 5.Forever Young (130 points)

Lightning Results 4.Team1337 (150 points) 5.Forever Young (130 points)

Lightning Results 3.Team A (310 points) 4.Team1337 (150 points) 5.Forever Young (130 points)

Lightning Results 2.Farm Squad 4 (320 points) 3.Team A (310 points) 4.Team1337 (150 points) 5.Forever Young (130 points)

Lightning Results 1.HyperDonkeys (360 points) 2.Farm Squad 4 (320 points) 3.Team A (310 points) 4.Team1337 (150 points) 5.Forever Young (130 points)

Standard Submissions 6 participating teams: Farm Squad 4 Forever Young HyperDonkeys Team A Team1337 X3M

Overall Results: Standard Problem 1: 1.HyperDonkeys 2.Team A 3.X3M 4.Team Forever Young

Overall Results: Standard Problem 2: 1. Farm Squad 4, HyperDonkeys 2. Team A 3. X3M 4. Forever Young 5. Team1337

Overall Results: Standard Problem 3: 1.HyperDonkeys 2.Team A, X3M 3.Farm Squad 4 4.Forever Young 5.Team1337

Overall Results: Standard Problem 4: 1.HyperDonkeys 2.X3M 3.Team A 4.Team Forever Young

Overall Results: Standard Problem 5: 1.HyperDonkeys 2.X3M 3.Farm Squad 4 4.Team A 5.Forever Young 6.Team1337

Overall Results: Standard Problem 6: 1.HyperDonkeys, Team A, X3M 2.Farm Squad 4, Forever Young, Team1337

Overall Results: Standard Problem 7: 1.Farm Squad 4, HyperDonkeys, X3M 2.Team Forever Young 4.Team A

Overall Results: Standard Problem 8: 1.HyperDonkeys, X3M 2.Team Forever Young, Team A

Overall Results: Standard Problem 9: 1.Forever Young, Farm Squad 4, HyperDonkeys, X3M 2.Team A 3.Team1337

Overall Results: Standard Problem 10: 1.Farm Squad 4, HyperDonkeys, X3M 2.Team A 3.Team Forever Young

The Ranking

Final Results 6.Team1337 (160 points)

Final Results 5.Forever Young (165 points) 6.Team1337 (160 points)

Final Results 4.Team A (260 points) 5.Forever Young (165 points) 6.Team1337 (160 points)

Final Results 3.Farm Squad 4 (270 points) 4.Team A (260 points) 5.Forever Young (165 points) 6.Team1337 (160 points)

Final Results 2.X3M (370 points) 3.Farm Squad 4 (270 points) 4.Team A (260 points) 5.Forever Young (165 points) 6.Team1337 (160 points)

Final Results 1.HyperDonkeys (500 points) 2.X3M (370 points) 3.Farm Squad 4 (270 points) 4.Team A (260 points) 5.Forever Young (165 points) 6.Team1337 (160 points)

Winners First Place – Best Standard Submission (Lm100): HyperDonkeys Second Place – Runner Up Standard Submission (Lm75): X3M Best Lightning Submission (Lm50): HyperDonkeys

Prosit tal-programmi!