Results 1 to 12 of 12

Thread: ICFP contest starts today (Friday 18th June 2010)

  1. #1
    Member
    Join Date
    Feb 2010
    Location
    Nordic
    Posts
    200
    Thanks
    41
    Thanked 36 Times in 12 Posts

    ICFP contest starts today (Friday 18th June 2010)


  2. #2
    Member
    Join Date
    Feb 2010
    Location
    Nordic
    Posts
    200
    Thanks
    41
    Thanked 36 Times in 12 Posts
    A longer running, mathematical programming contest has just started: http://azspcs.net/Contest/Cards

  3. #3
    Member biject.bwts's Avatar
    Join Date
    Jun 2008
    Location
    texas
    Posts
    449
    Thanks
    23
    Thanked 14 Times in 10 Posts
    I suspect that the contest will really end in a few days at most. Just as soon as some one submits the optimal card arrangements its electively over.

  4. #4
    Member
    Join Date
    Feb 2010
    Location
    Nordic
    Posts
    200
    Thanks
    41
    Thanked 36 Times in 12 Posts
    Seriously, I think you under estimate the rigour of those posing the questions But do enter, its a lot of fun!

  5. #5
    Expert
    Matt Mahoney's Avatar
    Join Date
    May 2008
    Location
    Melbourne, Florida, USA
    Posts
    3,255
    Thanks
    306
    Thanked 779 Times in 486 Posts
    Brute force search for the optimal solution works for up to 13 cards, but not for 97. I'm looking for mathematical structure to the solutions, but there are no obvious patterns in the solutions for small decks that I see.

  6. #6
    Member
    Join Date
    Oct 2010
    Location
    Germany
    Posts
    286
    Thanks
    9
    Thanked 33 Times in 21 Posts
    Funny thing: The ICFP contest is from the university I'm going to.

  7. #7
    Member
    Join Date
    Feb 2010
    Location
    Nordic
    Posts
    200
    Thanks
    41
    Thanked 36 Times in 12 Posts
    Nice to see you on the mailing list, Matt.

    My brute forcer takes 1.5 secs on N=13 on my laptop, and I've bruted as far as N=19 (almost finished running now, a week later). Brute as in a lot of culling, but no guessing, and exhaustive. I can't go to further N, obviously. Possibly one step further if I borrow a cluster. But that isn't going to make me top-10 in this contest.

    And there are plenty of patterns, but the next N that I brute seems to invalidate or add exceptions to the patterns I've inferred from the lower N....

    As I know that some of the top-3 are using GWBasic, there is clearly patterns that we haven't yet seen...

  8. #8
    Expert
    Matt Mahoney's Avatar
    Join Date
    May 2008
    Location
    Melbourne, Florida, USA
    Posts
    3,255
    Thanks
    306
    Thanked 779 Times in 486 Posts
    19 would be a new record. http://www.domain-b.com/technology/2..._continue.html
    I'm not able to submit solutions yet. I registered on Saturday but I'm waiting for a confirmation email.

  9. #9
    Member
    Join Date
    Feb 2010
    Location
    Nordic
    Posts
    200
    Thanks
    41
    Thanked 36 Times in 12 Posts
    If I understand it correctly, the 'pure' topswops is a win/lose thing; from a randomly shuffled pack of cards, solve it until you reach 1, and you win if the pack is sorted. That is to say, there are plenty of solutions where the pack is not sorted. Knuth and Sudborough+Morales set bounds in this search, rather than finding the solution with the most steps. That's if I've understood the links.

    There are lots of people who have submitted the known-optimal N=19 in terms of this contest. I was optimistic saying my N=19 brute was nearly finished; its still crunching away, and I know others that are also still running N=19.

    But clearly its brains not braun that will win this contest.

  10. #10
    Member
    Join Date
    Feb 2010
    Location
    Nordic
    Posts
    200
    Thanks
    41
    Thanked 36 Times in 12 Posts
    Two weeks until ICFP contest 2011! (Friday 18th - 21st June 2011)
    http://www.icfpcontest.org/2011/04/contest-schedule.html

  11. #11
    Member
    Join Date
    Feb 2010
    Location
    Nordic
    Posts
    200
    Thanks
    41
    Thanked 36 Times in 12 Posts
    And the contest is open! http://www.icfpcontest.org/2011/06/t...tarts-now.html

    Writing a program to play a card-game.

    Somehow, secondary escape estimation seems useful...

  12. #12
    Member
    Join Date
    Feb 2010
    Location
    Nordic
    Posts
    200
    Thanks
    41
    Thanked 36 Times in 12 Posts
    icfpcontest 2012 now running: http://icfpcontest2012.wordpress.com/task/

Similar Threads

  1. JPEG Compression Test [April 2010]
    By Skymmer in forum Data Compression
    Replies: 18
    Last Post: 7th February 2011, 23:30
  2. Slow Visual 2010
    By Cyan in forum The Off-Topic Lounge
    Replies: 23
    Last Post: 24th May 2010, 03:03
  3. Matlab Contest: Compressed Sensing
    By russelms in forum Data Compression
    Replies: 1
    Last Post: 28th April 2010, 23:48
  4. the latest rec math contest is just starting
    By willvarfar in forum The Off-Topic Lounge
    Replies: 0
    Last Post: 15th March 2010, 01:12
  5. Metacompressor.com first contest
    By Sportman in forum Data Compression
    Replies: 17
    Last Post: 15th October 2008, 01:50

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •