1. A multiple player board game apparatus, comprising:
a game board, having:
a central playing area of three hundred twenty-four playing positions of eighteen ranks and eighteen files in a substantially square array having four sides and four corners;
two initial playing extensions, each of the extensions having twenty-four playing positions of three ranks and eight files disposed upon each of the sides of said central playing area, each of the extensions being immediately adjacent a corresponding one of the corners of said central playing area and spaced apart from one another along each of the sides; and
eight sets of playing pieces, each of the sets corresponding to one of the initial playing extensions, respectively.
2. The multiple player board game apparatus according to claim 1, wherein:
said playing positions comprise alternating light colored positions and dark colored positions in a checkerboard pattern;
each of the initial playing extensions further includes uniform coloring of the light colored positions therein; and
the light colored positions are colored differently from one another in each of the different initial playing extensions.
3. The multiple player board game apparatus according to claim 2, wherein each of said sets of playing pieces is colored substantially identically to said light colored positions of said corresponding one of said initial playing extensions.
4. The multiple player board game apparatus according to claim 1, wherein said sets of playing pieces comprise eight sets of chess pieces, with each of said sets being colored differently from one another.
5. The multiple player board game apparatus according to claim 1, wherein said sets of playing pieces comprise eight sets of checkers, with each of said sets being colored differently from one another.
6. A method of playing a multiple player board game using the apparatus of claim 1, comprising the steps of:
(a) selecting from two to eight players;
(b) assigning one of the sets of playing pieces to each of the players;
(c) determining the order of play by the players;
(d) placing the playing pieces in their starting array upon their corresponding initial playing extensions;
(e) sequentially and selectively moving the playing pieces in accordance with the previously established order of play; and
(f) winning the game by capturing the playing pieces of the other players.
7. A method of playing a multiple player board game according to the method of claim 6, further including the step of providing chess playing pieces for the sets of playing pieces.
8. A method of playing a multiple player board game according to the method of claim 6, further including the step of providing checkers for the sets of playing pieces.
9. A method of playing a multiple player board game, comprising the steps of:
(a) providing a game board having a central playing area of three hundred twenty-four playing positions of eighteen ranks and eighteen files in a substantially square array having four sides and four corners;
(b) further providing two initial playing extensions each comprising twenty-four playing positions of three ranks and eight files disposed upon each of the sides of the central playing area, each immediately adjacent a corresponding one of the corners of the central playing area and spaced apart from one another along each of the sides;
(c) further providing eight sets of chess pieces, with each of the sets corresponding to one of the initial playing extensions;
(d) selecting from two to eight players;
(e) assigning one of the sets of chess pieces to each of the players;
(f) determining the order of play by the players;
(g) placing the chess pieces in their starting array upon their corresponding initial playing extensions;
(h) sequentially and selectively moving the chess pieces in accordance with the previously established order of play; and
(i) winning the game by having the last king remaining free of check.
10. The method of playing a multiple player board game according to claim 9, further comprising the steps of:
(a) coloring the playing positions in alternating light and dark colors, in a checkerboard pattern;
(b) uniformly coloring the light colored positions of each one of the initial playing extensions; and
(c) differently coloring the light colored positions of the different initial playing extensions.
11. The method of playing a multiple player board game according to claim 10, further comprising the step of coloring the chess pieces of each of the sets substantially identically to the light colored positions of a corresponding one of the initial playing extensions.
12. The method of playing a multiple player board game according to claim 9, further comprising the steps of:
(a) selectively moving the pawns of the sets of chess pieces up to three positions forward on an initial move; and
(b) selectively moving the pawns of the sets of chess pieces up to two positions forward on a subsequent move.
13. The method of playing a multiple player board game according to claim 9, further comprising the step of selectively moving the pawns of the sets of chess pieces one position laterally on moves subsequent to the initial move.
14. The method of playing a multiple player board game according to claim 9, further comprising the steps of:
(a) selectively advancing at least one pawn across the center of the game board;
(b) continuing to selectively advance the at least one pawn across one of the initial playing extensions across the center of the game board from the starting position of the at least one pawn; and
(c) promoting the at least one pawn to a chess piece of higher rank.
15. A method of playing a multiple player board game, comprising the steps of:
(a) providing a game board having a central playing area of three hundred twenty four playing positions of eighteen ranks and eighteen files in a substantially square array having four sides and four corners;
(b) further providing two initial playing extensions each comprising twenty-four playing positions of three ranks and eight files disposed upon each of the sides of the central playing area, each immediately adjacent a corresponding one of the corners of the central playing area and spaced apart from one another along each of the sides;
(c) further providing eight checker playing sets, with each of the sets corresponding to one of the initial playing extensions;
(d) selecting from two to eight players;
(e) assigning one of the checker sets to each of the players;
(f) determining the order of play by the players;
(g) placing the checker sets in their starting array upon their corresponding initial playing extensions;
(h) sequentially and selectively moving the checkers of the sets in accordance with the previously established order of play; and
(i) winning the game by having the last remaining checkers on the game board.
16. The method of playing a multiple player board game according to claim 15, further comprising the steps of:
(a) coloring the playing positions in alternating light and dark colors in a checkerboard pattern;
(b) uniformly coloring the light colored positions of each one of the initial playing extensions; and
(c) differently coloring the light colored positions of the different initial playing extensions.
17. The method of playing a multiple player board game according to claim 16, further comprising the step of coloring the checkers of each of the sets substantially identically to the light colored positions of a corresponding one of the initial playing extensions.
18. The method of playing a multiple player board game according to claim 15, further comprising the step of selectively moving the checkers of the sets up to two positions forward on a move.
19. The method of playing a multiple player board game according to claim 15, further comprising the steps of:
(a) selectively advancing at least one checker across the center of the game board;
(b) continuing to selectively advance the at least one checker across one of the initial playing extensions across the center of the game board from the starting position of the at least one checker; and
(c) promoting the at least one checker to permit reversal of movement.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method for recovering from an abnormal termination error condition, the method comprising:
detecting when an abnormal termination error condition has occurred;
determining whether the abnormal termination error condition was due to a program referencing storage that has not been obtained;
determining whether the storage that has not been obtained was recently freed storage; and,
reobtaining the recently freed storage when the storage that has not been obtained is recently freed storage.
2. The method of claim 1, wherein
the determining whether the storage that has not been obtained was recently freed comprises scanning a history of storage freeing operations to determine whether the storage location accessed by the storage access that caused the abnormal termination error was recently freed from within the same address space.
3. The method of claim 2, wherein
the storage freeing operations correspond to FREEMAIN operations.
4. The method of claim 1, further comprising
allowing the program referring storage that has not been obtained to access the storage and to continue execution.
5. The method of claim 1, further comprising
allowing dump processing to capture information relating to the abnormal termination error, so the error is surfaced and diagnostic work can be taken to permanently correct the error.
6. The method of claim 1, wherein
the abnormal termination error corresponds to an ABEND operation.
7. A system comprising:
a processor;
a data bus coupled to the processor; and
a computer-usable medium embodying computer program code, the computer-usable medium being coupled to the data bus, the computer program code comprising instructions executable by the processor and configured for:
detecting when an abnormal termination error condition has occurred;
determining whether the abnormal termination error condition was due to a program referencing storage that has not been obtained;
determining whether the storage that has not been obtained was recently freed storage; and,
reobtaining the recently freed storage when the storage that has not been obtained is recently freed storage.
8. The system of claim 7, wherein
the determining whether the storage that has not been obtained was recently freed comprises scanning a history of storage freeing operations to determine whether the storage location accessed by the storage access that caused the abnormal termination error was recently freed from within the same address space.
9. The system of claim 8, wherein
the storage freeing operations correspond to FREEMAIN operations.
10. The system of claim 7, wherein the computer program code further comprises instructions executable by the processor and configured for
allowing the program referring storage that has not been obtained to access the storage and to continue execution.
11. The system of claim 7, wherein the computer program code further comprises instructions executable by the processor and configured for:
allowing dump processing to capture information relating to the abnormal termination error, so the error is surfaced and diagnostic work can be taken to permanently correct the error.
12. The system of claim 11, wherein
the abnormal termination error corresponds to an ABEND operation.
13. A computer-usable medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
detecting when an abnormal termination error condition has occurred;
determining whether the abnormal termination error condition was due to a program referencing storage that has not been obtained;
determining whether the storage that has not been obtained was recently freed storage; and
reobtaining the recently freed storage when the storage that has not been obtained is recently freed storage.
14. The computer-usable medium of claim 13, wherein
the determining whether the storage that has not been obtained was recently freed comprises scanning a history of storage freeing operations to determine whether the storage location accessed by the storage access that caused the abnormal termination error was recently freed from within the same address space.
15. The computer-usable medium of claim 14, wherein
the storage freeing operations correspond to FREEMAN operations.
16. The computer-usable medium of claim 15, wherein the computer program code further comprises instructions executable by the processor and configured for:
allowing the program referring storage that has not been obtained to access the storage and to continue execution.
17. The computer-usable medium of claim 13, wherein the computer program code further comprises instructions executable by the processor and configured for:
allowing dump processing to capture information relating to the abnormal termination error, so the error is surfaced and diagnostic work can be taken to permanently correct the error.
18. The computer-usable medium of claim 17, wherein
the abnormal termination error corresponds to an ABEND operation.