Need Harness Racing Handicapping Program Coded

Hi, Thanks for considering coding our harness racing handicapping program. We have included enough information for you to decide if you are qualified and would like to bid on our project. Download our [login to view URL] file for further examination and information. We explain in detail. ## Deliverables The handicapping program, after approved, will use six different handicapping methods and will be used on 2,000 plus, past races whose outcome is known. The two best methods will then be used to handicap future harness races plus we may require a new program be written to use only the two most successful handicapping methods which will require a new job order from us. This should be a very simple coding procedure as we will supply all .dbf files and all simple formulas for each method in a .qpw format. We will also supply a SUGGESTED ONLY final results page. The final results page being the three picks for each of the six handicapping methods. You will need to study the .dbf files to be sure you know which .dbf file to use and what information each contains before you start writing the harness racing handicapping program. We will not detail each .dbf file for you, that will be your responsibility. The .dbf files are very easy to read. Study them using one race should be all you will need to understand where you need to find your information. The program requirements of the .dbf files are minimal. Harness Handicapping Program Requirements (rough outline) This may not be totally complete because we are not programmers or coders but it will be as close as we can make it as laymen. The program will use six different simple handicapping methods. With each method we supply a simple mathematical formula for the method. We will use the finished harness-handicapping program to determine which two of the six methods prove to be the best for our experiment. We will run over 2,000 past racing cards (nights) that contain an average of 10 races per card program through the finished harness-handicapping program. We have the results of each race, so we will know by the results which of the six methods prove best. We will use races that were run on different size harness tracks..1/2 mile tracks..5/8 mile tracks..1 mile tracks. When we finish we should have idea which method of the six, works best on each size track. The finished harness-handicapping program will work on any size track. The finished harness-handicapping program will extract data from .dbf files of each race in a card and use our simple mathematical formulas to choose three probable horses of which one of the three should win the race approximately 70 to 75% of the time. We will be using racing forms in PDF format and an .exe file of each race (that will extract the .dbf files for each race after a double click of the .exe file) from TrackMaster.com. We have included a sample of the .dbf files in the folder titled "[login to view URL] files" for your examination. Download our [login to view URL] file for further examination and information. Our harness-handicapping program requirements will use only a portion of the .dbf files and file information. You will have to familiarize yourself with the information in the .dbf files in order to use the proper .dbf file and information needed by the program as needed to produce the expected program outcome as seen in our harness-handicapping examples in a Quattro Pro format .qpx for the winning bidder. This should be a simple program to write for an experienced programmer. Having knowledge of horse racing and harness racing in particular will be of help. We will only reveal our mathematical formulas to the winning program coder, for obvious reasons. Harness races usually have from 6 to 11 horses per race. Usually 8 or 10 according to the track size. One-mile tracks usually have from 7 to 10 horses per race. One half-mile tracks usually have 6 to 8 horses per race. The harness-handicapping program must be able to handicap any number of horses per race. The winning programmer-coder will be given step-by-step instruction as to what is needed by the harness-handicapping program, but of course the coder must also use his or her own imagination and input as well. Please open the included [login to view URL] file. In the downloadable [login to view URL] file The harness-handicapping program that you will code will need the following from the .dbf files that are extracted from the .exe file. Starting at the top of the page in the RACE HEADER section. Race# Track Name & Date Class rating of the race Gait..Pace or Trot Race Distance HORSE HEADER SECTION Horse Name Driver Name Program Number Post Position PAST PERFORMANCE SECTION Date Class Rating Speed Rating Calls & Lengths Back (Finish Position and Lengths Back at Finish) plus any and all of the following codes in the calls and lengths back. (x, [], ac, bd, be, bt, bl, ch, dx, ex, fl, i, ii, ihr, im, pu, dnf) Described for the winning programmer-coder. Look at the included [login to view URL] These codes will appear in the .dbf files when and where occurred. This should be all that is needed from the .dbf files for the program. If we missed any, remember that we are not programmers. The harness-handicapping program will need the following for each horse in the race from the .dbf files to produce the proper outcome along with our simple mathematical formulas. The following information is needed from the past performance of the 6 or less most recent usable races. The program would like the 6 most recent usable race information but there will be times when less than 6 usable race information are all that is available. Last 6 most recent usable race dates Last 6 corresponding post-positions Last 6 corresponding Class Ratings (CR) Last 6 corresponding Speed Ratings (SR) Last 6 corresponding finish positions Last 6 corresponding lengths back at finish Today's race date Horse's Name Driver's Name Today's race class rating (CR) Horse number (HN) for each horse Post Position for each horse HN and post position are usually the same except when there is an (e) entry eg.1 &1a or when a horse is scratched. The program must b able to adjust postpositions when needed after a horse is scratched as this can affect the programs picks at times. Example: The #1 horse is scratched that would mean that all horses would move up one postposition. #2 to 1..#3 to 2 etc. Lets say that the #5 horse was scratched, then all postpositions after the #5 would move up one position. The #1 through #4 postpositions would stay the same. The harness-handicapping program user must be able to input which postposition/postpositions was scratched and the program make the adjustments automatically which will change some formulas. Examples of what the program user might have to input for the program Required for research purposes: Today's track size [input] example:1/2-5/8-7/8-1- 1 1/8- Required for program Track three digit track ID code: [input] this is the first three letters of the .exe file and should be used in conjunction with the harness program to identify the .exe file to use for the .dbf's. Enter month of race to be converted: [input] Enter day of race to be converted: [input] Select a display or display & print option Display only (D) Display and print (DP) Display only: [input] Display and print: [input] Post Position Number Scratched: [input] Race Number: [input] The necessary adjustment would be already programmed in. The program would make the adjustments according the postposition and race numbers entered. One last thought. After we finish testing we would like to compare all winners to try and find a commonality among winners on different size tracks. Example: What do all winners on ½ mile tracks have in common as to their stats? Same applies to all winners at 5/8 and 1 mile tracks. Any suggestions will be welcome. We think this is a very detailed example/s with which to make your necessary bid. Download our [login to view URL] file for further examination and information. Thanksfor your consideration