MATLAB Programming Contest Blog

May 15th, 2007

Midcontest analysis by Lucio

Lucio Cetto has written the midcontest analysis. In his analysis, Lucio reviews 3 different winning entries, comparing the different approaches to the game’s goals. He also offers his own solutions created using a graph created by Sidney and additional graph theory algorithms and also a package and purge % approach.

Take a look at Lucio’s analysis and you may find some food for thought on new approaches to your own solution!

Author picture

By Helen Chen

Helen is part of the MATLAB Central team. She spends her days hanging out with really cool folks online at MATLAB Central and at MathWorks HQ in Natick.

10:33 UTC | Posted in Peg Solitaire | Permalink | 1 Comment »

You can follow any responses to this entry through the RSS 2.0 feed. You can skip to the end and leave a response. Pinging is currently not allowed.

One Response to “Midcontest analysis by Lucio”

  1. Yi Cao replied on May 17th, 2007 at 17:12 UTC :

    The findsolitairepackages function does not work with even a small problem, such as the first board in the testsuit, just because the size of G is too large to be handled

Leave a Reply

Wrap code fragments inside <pre> tags, like this:

<pre class="code">
a = magic(3);
sum(a)
</pre>

If you have a "<" character in your code, either follow it with a space or replace it with "&lt;" (including the semicolon).
MathWorks

About

The MATLAB Programming Contest is a semi-annual competition where contestants submit MATLAB code to try to solve a challenge.

See behind the scenes of the MATLAB Programming Contest

Subscribe

Recent Comments

Blog Admin

These postings are the author's and don't necessarily represent the opinions of The MathWorks.