Landon Curt Noll
658669a73a
fix experimental web site links in experimental index.html sync CNAME with https://github.com/ioccc-src/winner/blob/master/CNAME improve .gitignore files Added to each .gitignore file, comments on how to sort. Put into winner .gitignore files, ignore *.dSYM files. Put into winner .gitignore files, ignore indent.c, indent.o and indent files. This is done so that the winner directory can more self contained. We did not put into winner .gitignore files, however, excludes of .-files as found in the top level .gitignore file. As .-files are not allowed by mkiocccentry, the top level .gitignore file remains sufficient. Added to year level .gitignore files, excludes of mkentry or iocccsize files as needed. Sorted (via sort -d -u) all .gitignore file.
To build:
make all
There is Alternate code available for if you have an old enough compiler.
To use:
./lievaart
# enter a level and start playing as described below
Try:
To see what it would have looked like without the size restrictions:
./lievaart2
# enter a level and start playing as described below
Alternate code:
If you have an old enough compiler you might wish to try using it. To use:
make alt
Use ./lievaart.alt as you would ./lievaart above.
Judges' remarks:
We believe that you too will be amazed at just how much power Mr. Lievaart packed into 1024 bytes!
This Plays the game of Reversi (Othello)! Compile and run. It then asks for a playing level. Enter 0-10 (easy-hard). It then asks for your move. A move is a number within 11-88, or 99 to pass. Illegal moves (except for an illegal pass) are rejected. Then the computer does its move (or a 0 to pass), until the board is full.
It plays rather well, for such a small program! Lievaart had to leave out the board printing routine, so you'll have to take a real game board to play it (or see below). ... Also due to space-limitations (the rules for 1987 had a limit of 1024 byes), Lievaart took out the passing-handler, which makes its ending-game rather poor. But further it knows all the rules, uses alpha-beta pruning, and it plays for instance on mobility(!). Most important: it can play a pretty good game of Reversi!
The Author was kind enough to supply the fully functional version of the program. The file lievaart2.c contains what the program would have been without the size restriction. This version has the full end game logic and displays the board after each move! See above for how to use this.
Author's remarks:
No remarks were provided by the author.
Copyright and CC BY-SA 4.0 License:
This file is Copyright (c) 2023 by Landon Curt Noll. All Rights Reserved. You are free to share and adapt this file under the terms of this license:
Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)
For more information, see: https://creativecommons.org/licenses/by-sa/4.0/