Ron Jeffries <ronjeffr...@REMOVEacm.org> wrote in message <news:firstname.lastname@example.org>...Following on from BUFD version of the Bowling Game (given that we've
> Adventures in C#: The Bowling Game
> Ron Jeffries
> When I demonstrate Test-Driven Development using the Bowling Game
figured out the solution as far as #3) a language with pattern
matching and list functions would allow a recursive solution (compare
to #4) like this:
Start = score [0,0, 0,0, 0,0, 0,0, 0,0, 0,0, 0,0, 0,0, 0,0, 10,
score pins total 10 = total
score [x,y] total frame = total + x + y
score [x,y,z:rest] total frame
best wishes, Isaac
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.