Continuing from last week’s Lesson, the task is now to combine the chessboard output from this month’s Exercise solution with the knight’s random location. This step is the next one leading to the result, which is to plot how a knight moves on a chessboard.
Continue reading →

A chessboard is a gird, traditionally eight-by-eight squares for 64 positions. This game matrix can be implemented in code in a variety of ways, with a two-dimensional array being the most obvious. But this option isn’t what I chose when programming how a knight moves (from last week’s Lesson).
Continue reading →

Computers and chess go together like Mr. Spock and Star Trek. The character of Spock is pure genius, a crazy addition to the mix that provided depth and wonder to the TV show and later movies. In chess, it’s the knight that provides the crazy addition, making the game of chess more than an advanced variation on checkers.
Continue reading →

I don’t believe I’ll ever absorb all the wondrous potential of Linux/Unix. Case in point is the /dev/random file. It’s exactly what the name implies: random stuff. And you can use this nifty file in your C programs to generate random values.
Continue reading →

Continuing from last week’s Lesson, just as you can’t use the equal sign to assign an mpz_t huge integer value, you can’t use the standard arithmetic operators to do math — huge math. Nope, you must use special GMP library functions to do the math.
Continue reading →

I’ve written a few books on using external libraries, which I shamelessly plug later in this post. After confirming that the library is installed (see last week’s post), the next step isn’t to code, but rather to peruse the online documentation, the API or Application Programming Interface.
Continue reading →

Unlike real numbers, integers are stored in binary as-is: The bits are read and values set. The only limit on an integer’s value is on the number of bits in the binary chunk — the bit width — which sets the value’s range, positive and negative or just positive.
Continue reading →

The C language is weak when it comes to strings. Even the paltry assortment of string.h manipulation functions lacks quite a few tricks that are readily available to other languages. Among them is a function to reverse a string. So why not code your own?
Continue reading →

Generating a table where the items march left-to-right and then down the page is uncomplicated with stream output. What’s more difficult is outputting a table where the data drops in columns top-down before going left-to-right. Performing this feat requires no screen/cursor manipulation, only clever coding.
Continue reading →

This month’s Exercise searched for and output the first 100 cyclops numbers. But instead of spewing them out in a long column, my solution set them in a table. The values marched across the screen in neat rows. This trick is rather easy to accomplish, but in my solution I wanted some flexibility with the column number.
Continue reading →