Mastermind

mastermindloop.c

    while ((BLACKPEGS(workingCandidate.score) < PEGS) && currentListOfCandidates.indexOfLastEntryAdded >= 0) {
        /////your code here
        //If (working candidate is not infeasible)
        //Generate all 1-step offspring and add to openList
        /// loop through pegs
        printf("Run");
        for(int i = 0; i<4; i++){
            /// save old val
            int oldval = workingCandidate.variableValues[i];
            /// loop throgugh colours
            for(int c=0; c<4; c++ ){
                /// if colour is not old val
                if(c!=oldval) {
                    int seen;
                    /// put colour in peg position
                    ChangeColourOfPegParam1_ToParam2(i, c);
                    /// if colour not seen before candidate
                    seen = GetIndexOfWorkingCandidateInThisList(currentListOfCandidates);
                    /// put at the end of the open list
                    if(seen==NOTFOUND){
                        seen = GetIndexOfWorkingCandidateInThisList(listOfExaminedCandidates);
                        if(seen==NOTFOUND){
                            AddWorkingCandidateToCurrentList();
                        }

                    }

                }
            }



        }

        //Move working candidate to closedList
        AddWorkingCandidateToExaminedList();
        //Move first item in openList into working candidate
        CopySolutionFromCurrentListIntoWorkingCandidate(0);
        RemoveSolutionFromCurrentList(0);
        //Test (working candidate)
        ScoreThisTry();