Scheme Assignments

Below are two basic problem solving assignments demonstrating my experience with Scheme/LISP.

Maze Solver

The maze solver takes in data with the format

((width height) (startx starty) (goalx goaly)

((tilex tiley) (adjoiningx adjoiningy) (adjoiningx adjoiningy))

((tilex tiley) (adjoiningx adjoiningy) (adjoiningx adjoiningy))

...

)

And generates the optimal path route through the defined maze

Racket Code

4 Colour Map

The map colour solver takes in data with the format

(regioncount colourcount

(regionNum adjacentRegion adjacentRegion)

(regionNum adjacentRegion)

...

)

And generates an optimal colouring solution for the regions

Racket Code

Back to portfolio