1 / 16

Code Shoot Out

Code Shoot Out. Tulsa .Net Users Group. Lessons Learned. Please read all emails. Puzzles do change or input is corrected/clarified according to feedback. We need better infrastructure to judge programs. All execution timing will be done outside of program. All results need to be uniform.

barid
Download Presentation

Code Shoot Out

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Code Shoot Out Tulsa .Net Users Group

  2. Lessons Learned • Please read all emails. Puzzles do change or input is corrected/clarified according to feedback. • We need better infrastructure to judge programs. • All execution timing will be done outside of program. • All results need to be uniform.

  3. Lessons Learned • We are creating a program to call your program. It will time your program’s execution time. • Gone are text files. Two xml files will be needed. • One for input and one for output of your results. • Your results file should be named Puzzle2Results_YourName#1.xml • e.g. Puzzle2Results_LarryConklin#1.xml

  4. Lessons Learned • Winners must come up and do a show and tell on their code. • Winner must make their code available to Users group. Let other people learn from your success.

  5. Puzzle Two Tulsa .Net Users Group

  6. Common Rules • Use visual studio 2008, 2010, or 2012. • No third part libraries can be used. I.e STL, Boost, dtSearch, etc. • Must be able to compile code on judgment night. • Winner must be able to explain code. • Must be a VB.Net, C#, or C++ .Net program. All code must be managed code that runs on the CLR. • Winner must be present to win.

  7. Common Rules • Winning program must use the standardize xml output. • Programming teams are allowed. • You can enter more than one program. • Remember this is your project do not use your employer’s time to work on this. Be nice.

  8. Visit all State Capitals

  9. Objective Visit all 48 state capitals. Visit each state only once. Find the shortest path. Start in Maine. End in the State of ??????

  10. Rules for this Puzzle only • You can use Silverlight extensions. • You can use APIto Bing map controls. • You can’t use Google or anyone else’s third party map controls. Let’s be nice to Microsoft who is a sponsor.

  11. XML Input Sample <?xml version="1.0" encoding="utf-8"?> <Puzzle> <PuzzleDetails> <PuzzleName>Shortest Path To State Capitals</PuzzleName> <PuzzleNumber>2</PuzzleNumber> <PuzzleXMLVersion>1.0</PuzzleXMLVersion> <StartState>Maine</StartState> </PuzzleDetails> <States> <State> <Name>Alabama</Name> <Capital>Montgomery</Capital> <Latitude>32.361538</Latitude> <Longitude>-86.279118</Longitude> <BoarderingStates> <BorderingState>Mississippi</BorderingState> <BorderingState>Tennessee</BorderingState> <BorderingState>Georgia</BorderingState> <BorderingState>Florida</BorderingState> </BoarderingStates> </State>

  12. XML Output Sample <ParticipantInformation> <ParticipantName>Your Name Here</ParticipantName> <Category>Advance</Category> </ParticipantInformation> <ProgramInformation> <ProgramName>IWin.exe</ProgramName> <VisualStudioVersion>2008</VisualStudioVersion> <DotNetLanuage>C#</DotNetLanuage> </ProgramInformation> <Path> <Path> <Link> <LinkNumber>1</LinkNumber> <State>Main</State> <DestinationState>Second State Name</DestinationState> <MileageFromPreviousLin/> </Link> <Link> <LinkNumber>2</LinkNumber> <State>Second State</State> <DestinationState>Third State Name</DestinationState> <MileageFromPreviousLinK>12345</MileageFromPreviousLink> </Link> <TotalMileage>9999999</TotalMileage> <NumberOfStatesVisted>48</NumberOfStatesVisted> </Path>

  13. Gotcha’s • Only 48 continental states need to be visited. (exclude Alaska, Hawaii, and District of Columbia). • Can only visit any state once. • Judging is based on distance between links, correct links, time of execution. • You start in Maine.

  14. Questions • What does distance between links need to be measured in? • Miles, two decimals At what level of precision (how many decimals?) • What is ”distance between links” (straight line, highways, highways, excluding toll roads, etc.)? • This depends on how much you want to win.

  15. Questions • One of the conclusions I drew, was that there was only one RIGHT answer. That could be mentioned near the end. • Do I have to go through a “BorderingState”? I assume so, but you didn’t say it in the specs . • . • Loot – you didn’t mention what the prizes were. • We need to talk about this question. • You didn’t mention the different categories (advanced, beginner, etc.). That could go on the common rules slide. Yes, I did.

  16. Answer An interesting map problem. http://www.cs.cmu.edu/~bryant/boolean/

More Related