We'll number the squares of the board this way: "first version" or "not really part of game." To indicate the unfinished versions of procedures, we'll use comments like You how we corrected these "bugs" and also will present a complete, correct If you type in these early versions, they won't work. These include some mistakes that we made, andĪlso some after-the-fact simplifications to make our explanationsĮasier. This chapter is to show you how a program is developed, so we're presentingĮarly versions of procedures. Programs don't always come out right the first time. (See Appendix A if this doesn't work for you.) You can load our program into Scheme by typing Techniques you've learned so far, we're going to write a program that plays Now that you've learned about higher-order functions, we're going to look atĪ large example that uses them extensively. University of California, Berkeley Matthewĭownload PDF version Back to Table of Contents BACK Simply Scheme: Introducing Computer Science 2/e Copyright (C) 1999 MIT Simply Scheme: Introducing Computer Science ch 10: Example: Tic-Tac-Toe
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |