The challenge
Develop an optimized algorithm to solve "The Grand Shipyard Puzzle: Pack the Block, Beat the Clock." Your solution should maximize efficiency in block packing and scheduling within the given constraints. All implementation details and methodology must be documented in a Technical Report.
Tracks / categories
This hackathon focuses on algorithmic optimization, with a Grand Shipyard Puzzle challenge.
Required tech & constraints
- Minimum team size: 1 member
- Maximum team size: 3 members
- Open to participants above the legal age of majority in their country of residence.
- All countries/territories are eligible, excluding standard exceptions.
- Any methodology is allowed: mathematical optimization, machine learning, heuristics, or a combination.
- All code and technical reports submitted by finalist teams will be made public as open source.
Submission requirements
- Preliminary Round: Algorithm code submission via the official competition platform. Top 30-40 teams advance.
- Final Round: Technical Report describing the approach, methodology, and results, along with algorithm code files.
- Finalist teams must present their approach and results.
- Full submission guidelines are available on the official competition website: www.optichallenge.com.
Judging criteria
- Algorithm Performance: Efficiency and accuracy of the optimization solution.
- Technical Report: Clarity and depth of methodology documentation.
- Code Quality: Readability, structure, and reproducibility.
Prizes
- 1st Place: KRW 70,000,000 (approx. $48,000 USD) + internship opportunities at LG CNS.
- 2nd Place: KRW 25,000,000 (approx. $17,000 USD) per team (2 winners).
- 3rd Place: KRW 10,000,000 (approx. $7,000 USD) per team (3 winners).
- Additional Prizes: For teams ranked 4th–20th.
- Total prize pool: KRW 200 million (approx. $130,000 USD) and additional prizes.
Bonus / optional points
Top-ranked winners may be eligible for additional benefits when applying to LG CNS, such as exemption from the document screening stage in the recruitment process.