From e6dfaf0d526a86f70ae6c7aa6e7c56503a000cdc Mon Sep 17 00:00:00 2001 From: Cody Boone Ferguson <53008573+xexyl@users.noreply.github.com> Date: Thu, 20 Apr 2023 10:22:21 -0700 Subject: [PATCH] Format fix 2000/robison/README.md --- 2000/robison/README.md | 90 ++++++++++++++++++++++-------------------- 1 file changed, 47 insertions(+), 43 deletions(-) diff --git a/2000/robison/README.md b/2000/robison/README.md index 3b03a816b..cc2637d95 100644 --- a/2000/robison/README.md +++ b/2000/robison/README.md @@ -42,17 +42,20 @@ Highly Compressed Program for Playing Hygienic Checkers ### FIELD OF INVENTION -The present invention generally relates to checkers. +The present invention generally relates to +[checkers](https://en.wikipedia.org/wiki/Checkers). ### BACKGROUND OF THE INVENTION -Within the field of checkers, the problem of finding a hygienic opponent -is difficult, as good opponents are peculiar to the tavern habitat of -cracker-barrels, pot-belly stoves, tobacco, and spittoons. +Within the field of [checkers](https://en.wikipedia.org/wiki/Checkers), the +problem of finding a hygienic opponent is difficult, as good opponents are +peculiar to the tavern habitat of cracker-barrels, pot-belly stoves, tobacco, +and spittoons. ### BRIEF SUMMARY OF THE INVENTION -The present invention plays checkers without spitting. +The present invention plays [checkers](https://en.wikipedia.org/wiki/Checkers) +without spitting. ### BRIEF DESCRIPTION OF SEVERAL VIEWS OF THE INVENTION @@ -66,36 +69,34 @@ FIG. 4 shows a method in accordance with the present invention. ### DETAILED DESCRIPTION OF THE INVENTION -Operator plays Black (x); the program plays White (o). Said Black goes -first. On operators turn, said program requests a position and direction. -FIG. 1 shows the numbering of the squares. FIG. 2 shows the numbering of -directions. As per standard rules, if one or more jumps are possible, one - of the jumps must be taken in preference to other moves. Said operator -enters the numbers for the position and direction. If after jumping over a -piece, another jump is possible, and said piece did not become a king after -said jump, standard rules require that another jump be taken. In said case, -said program requests a direction only in which to continue jumping from the -present position. Kings are denoted by upper case. FIG 3. shows a sample -board. There is a black king (X) on square 30 and a red king (O) on square -2. The numbers on the right are the numbers of the rightmost square in each -row. +Operator plays Black (`x`); the program plays White (`o`). Said Black goes first. +On operator's turn, said program requests a position and direction. FIG. 1 shows +the numbering of the squares. FIG. 2 shows the numbering of directions. As per +standard rules, if one or more jumps are possible, one of the jumps must be +taken in preference to other moves. Said operator enters the numbers for the +position and direction. If after jumping over a piece, another jump is +possible, and said piece did not become a king after said jump, standard rules +require that another jump be taken. In said case, said program requests a +direction only in which to continue jumping from the present position. Kings +are denoted by upper case. FIG. 3 shows a sample board. There is a black king +(`X`) on square 30 and a red king (`O`) on square 2. The numbers on the right are +the numbers of the rightmost square in each row. A player loses if they cannot make a legal move. Said loss is trivially true if player loses all of his/her pieces. The present invention announces said loser. -FIG. 4 shows a C program in accordance with the present invention. Control -flow is straightforward: control enters routine ``main'', executes a -plurality of statements, and exits via return statement. FIG. 4 presumes -that type int is 32 bits and short is 16 bits, which are essential to the -preferred embodiment of the invention. FIG. 4 also presumes that the host -computer uses ASCII encoding for characters. It should be obvious that -practitioners skilled in the art of C programming can remove said -limitations. +FIG. 4 shows a C program in accordance with the present invention. Control flow +is straightforward: control enters routine `main()`, executes a plurality of +statements, and exits via `return` statement. FIG. 4 presumes that type `int` +is `32 bits` and `short` is `16 bits`, which are essential to the preferred +embodiment of the invention. FIG. 4 also presumes that the host computer uses +ASCII encoding for characters. It should be obvious that practitioners skilled +in the art of C programming can remove said limitations. -The disclosure here describes a particular embodiment of the present -invention, and other embodiments within the spirit of this disclosure -are possible, as well as consumption of spirits while playing. +The disclosure here describes a particular embodiment of the present invention, +and other embodiments within the spirit of this disclosure are possible, as well +as consumption of spirits while playing. ### CLAIMS @@ -104,9 +105,8 @@ I claim, by letters patently absurd: 1. A method for playing checkers on a computer-based system, where said method's source code fits into 1536 countable bytes of source code, where a byte is countable if - - (a) it is not whitespace and - (b) it is not a {, }, or ; immediately followed by whitespace. + * it is not whitespace and + * it is not a '`{`', '`}`', or '`;`' immediately followed by whitespace. 2. The method of claim 1, further comprising a method of alpha-beta pruning that exploits the zero-sum nature of the game to unify alpha @@ -120,24 +120,23 @@ I claim, by letters patently absurd: skeptical manager that this is the well-known technique of "linear programming". -5. The method of claim 1, where ~- and -~ replace the obvious arithmetic +5. The method of claim 1, where `~-` and `-~` replace the obvious arithmetic operations. 6. The method of claim 1, further comprising a method where - - (a) strings are encrypted in a manner suitable as C strings, and - (b) 7-bit ASCII characters with uniform distribution are maximally - packed subject to the restriction that - (c) each byte is not countable. + * strings are encrypted in a manner suitable as C strings, and + * 7-bit ASCII characters with uniform distribution are maximally packed + subject to the restriction that each byte is not countable 7. A method for a computer-based system that uses a single shared code sequence to either sum a plurality of bits in an N-bit word or reverses them, in lg(N) time, depending upon a parameter. -DRAWINGS +### DRAWINGS -FIG 1. +#### FIG 1. +``` +--+--+--+--+--+--+--+--+ |32| |31| |30| |29| | +--+--+--+--+--+--+--+--+ @@ -155,17 +154,21 @@ FIG 1. +--+--+--+--+--+--+--+--+ | | 4| | 3| | 2| | 1| +--+--+--+--+--+--+--+--+ +``` -FIG. 2. +#### FIG. 2. +``` 1 0 \ / . / \ 3 2 +``` -FIG. 3. +#### FIG. 3. +``` o o X . 29 o . . . 25 o . . o 21 @@ -174,8 +177,9 @@ FIG. 3. . . x . 9 x x . . 5 x x O x 1 +``` -FIG. 4 +#### FIG. 4 [See attached listing.]