"knights" ChessSetArray: Results: positionPiece ? (createBoard 0 ?1) ==> ! Piece not found positionPiece ? (deleteFirst (createBoard 0 ?1)) ==> ! Piece not found positionPiece ? (createBoard 0 ?1) ==> ! Piece not found ChessSetList: Results: KnightHeuristic: Results: startTour ? -1 ==> ! Tour doesnt exist for odd size board startTour ? 1 ==> ! Tour doesnt exist for odd size board startTour ? -1 ==> ! Tour doesnt exist for odd size board startTour ? 1 ==> ! Tour doesnt exist for odd size board startTour ? -1 ==> ! Tour doesnt exist for odd size board startTour ? 1 ==> ! Tour doesnt exist for odd size board descendents (deleteFirst (createBoard ? ?1)) ==> ! Prelude.last: empty list startTour ? -1 ==> ! Tour doesnt exist for odd size board startTour ? 1 ==> ! Tour doesnt exist for odd size board descendents (deleteFirst (deleteFirst (createBoard ? ?1))) ==> ! Prelude.init: empty list descendents (deleteFirst (createBoard ? ?1)) ==> ! Prelude.last: empty list tourFinished (deleteFirst (createBoard 0 ?)) ==> ! Prelude.last: empty list startTour ? -1 ==> ! Tour doesnt exist for odd size board startTour ? 1 ==> ! Tour doesnt exist for odd size board descendents (deleteFirst (deleteFirst (deleteFirst (createBoard ? ?1)))) ==> ! Prelude.init: empty list descendents (deleteFirst (deleteFirst (createBoard ? ?1))) ==> ! Prelude.init: empty list descendents (deleteFirst (createBoard ? ?1)) ==> ! Prelude.last: empty list descendents (addPiece ? (deleteFirst (createBoard ?1 ?2))) ==> ! Prelude.last: empty list tourFinished (deleteFirst (createBoard 0 ?)) ==> ! Prelude.last: empty list startTour ? -1 ==> ! Tour doesnt exist for odd size board startTour ? 1 ==> ! Tour doesnt exist for odd size board descendents (deleteFirst (deleteFirst (deleteFirst (deleteFirst (createBoard ? ?1))))) ==> ! Prelude.init: empty list descendents (deleteFirst (deleteFirst (deleteFirst (createBoard ? ?1)))) ==> ! Prelude.init: empty list descendents (deleteFirst (deleteFirst (addPiece ? (createBoard ?1 ?2)))) ==> ! Prelude.last: empty list descendents (deleteFirst (deleteFirst (createBoard ? ?1))) ==> ! Prelude.init: empty list descendents (deleteFirst (addPiece ? (deleteFirst (createBoard ?1 ?2)))) ==> ! Prelude.last: empty list descendents (deleteFirst (createBoard ? ?1)) ==> ! Prelude.last: empty list descendents (addPiece ? (deleteFirst (deleteFirst (createBoard ?1 ?2)))) ==> ! Prelude.init: empty list descendents (addPiece ? (deleteFirst (createBoard ?1 ?2))) ==> ! Prelude.last: empty list descendents (addPiece ? (addPiece ?1 (deleteFirst (createBoard ?2 ?3)))) ==> ! Prelude.last: empty list tourFinished (deleteFirst (createBoard 0 ?)) ==> ! Prelude.last: empty list Queue: Results: inquireFront ([]) ==> ! Cannot inquire on empty Queue inquireBack ([]) ==> ! Cannot inquire on empty Queue removeFront ([]) ==> ! Cannot remove from an empty Queue removeBack ([]) ==> ! Cannot inquire on empty Queue inquireFront ([]) ==> ! Cannot inquire on empty Queue inquireBack ([]) ==> ! Cannot inquire on empty Queue removeFront ([]) ==> ! Cannot remove from an empty Queue removeBack ([]) ==> ! Cannot inquire on empty Queue inquireFront ([]) ==> ! Cannot inquire on empty Queue inquireBack ([]) ==> ! Cannot inquire on empty Queue removeFront ([]) ==> ! Cannot remove from an empty Queue removeBack ([]) ==> ! Cannot inquire on empty Queue inquireFront ([]) ==> ! Cannot inquire on empty Queue inquireBack ([]) ==> ! Cannot inquire on empty Queue removeFront ([]) ==> ! Cannot remove from an empty Queue removeBack ([]) ==> ! Cannot inquire on empty Queue inquireFront ([]) ==> ! Cannot inquire on empty Queue inquireBack ([]) ==> ! Cannot inquire on empty Queue removeFront ([]) ==> ! Cannot remove from an empty Queue removeBack ([]) ==> ! Cannot inquire on empty Queue inquireFront ([]) ==> ! Cannot inquire on empty Queue inquireBack ([]) ==> ! Cannot inquire on empty Queue removeFront ([]) ==> ! Cannot remove from an empty Queue removeBack ([]) ==> ! Cannot inquire on empty Queue inquireFront ([]) ==> ! Cannot inquire on empty Queue inquireBack ([]) ==> ! Cannot inquire on empty Queue removeFront ([]) ==> ! Cannot remove from an empty Queue removeBack ([]) ==> ! Cannot inquire on empty Queue inquireFront ([]) ==> ! Cannot inquire on empty Queue inquireBack ([]) ==> ! Cannot inquire on empty Queue removeFront ([]) ==> ! Cannot remove from an empty Queue removeBack ([]) ==> ! Cannot inquire on empty Queue inquireFront ([]) ==> ! Cannot inquire on empty Queue inquireBack ([]) ==> ! Cannot inquire on empty Queue removeFront ([]) ==> ! Cannot remove from an empty Queue removeBack ([]) ==> ! Cannot inquire on empty Queue inquireFront ([]) ==> ! Cannot inquire on empty Queue inquireBack ([]) ==> ! Cannot inquire on empty Queue removeFront ([]) ==> ! Cannot remove from an empty Queue removeBack ([]) ==> ! Cannot inquire on empty Queue Sort: Results: Writing: ChessSetArray.hs.html Writing: ChessSetList.hs.html Writing: KnightHeuristic.hs.html Writing: Queue.hs.html Writing: Sort.hs.html Writing: hpc_index.html Writing: hpc_index_fun.html Writing: hpc_index_alt.html Writing: hpc_index_exp.html ["ChessSetArray.hs","ChessSetList.hs","KnightHeuristic.hs","Queue.hs","Sort.hs"]