**Tags**

Cartesian product, computer code, Japanese multiplication method, math, multiplication, Pillow (PIL fork), Python code

On my regular blog I just posted about a Japanese visual multiplication method. It’s a cute trick that ties into the notion of grid multiplication techniques. (In general, multiplication techniques are of some interest due to the Mandelbrot set, which requires multiplying large numbers lots of times.)

It turns out code to generate the patterns was a lot easier than I thought it would be. The hardest part was generating the diagonal summing lines.

Here’s an example of the output:

The image above illustrates multiplying **2468 × 1357** using the Japanese base one visual method. (It’s base one in that each digit is represented by as many lines.)

The first number, **2468**, runs along the left from bottom-to-top; the second number, **1357**, runs along the top from left-to-right. Think of the multiplication as laid out from the lower-left, up to the upper-left, then over to the upper-right.

At the crossing of each pair of digits is a group of lines intersecting (16 groups in the image above). The number of line intersections in each group is its count — which is shown for each group.

Beige bands indicate “roads” where digits intersect. Each crossing is an intersection group. (So the road crossings form a Cartesian product of the two factors.)

Thin red lines are the summation diagonals. They are in a sense the output digits. Each diagonal sums the group counts along its length. Note that the lower-left and upper-right corners each have an implied diagonal corresponding to an output digit. (There is also an implied carry digit on the far left.)

**§**

The algorithm requires both input factors have at least two digits. The inputs are strings, so leading zeros are just another digit. That means it is possible to illustrate single-digit multiplication.

But it leaves something to be desired given the three-out-of-four null groups. Note the beige roads have a darker line to highlight the zero count of that digit.

**§ §**

The surprise for me was how simple much of the code turned out to be. Here’s the first part, where we condition the input numbers (which are strings).

a_str = argv[1] if 1 < len(argv) else '2468' b_str = argv[2] if 2 < len(argv) else '1357' a_nbr = int(a_str) b_nbr = int(b_str) c_nbr = a_nbr * b_nbr # Need lists of digits... a_digits = [int(ch) for ch in a_str] b_digits = [int(ch) for ch in b_str] a_len = len(a_digits) b_len = len(b_digits) # Sanity check... if a_len < 2: raise ValueError('Two digit minimum! (%s)' % a_str) if b_len < 2: raise ValueError('Two digit minimum! (%s)' % b_str) if 9 < a_len: raise ValueError('Two digit minimum! (%s)' % a_str) if 9 < b_len: raise ValueError('Two digit minimum! (%s)' % b_str) #

The first step is to convert them to integer values. Doing this successfully means the input strings are value numbers and lets us generate the expected result value.

The second step is to convert the strings into a list of single digits, the length of which determines the rows and columns of our grid. (We’ll store those lengths in handy variables just to make all the coming references to it cleaner.)

**§**

Now comes the fun part. Each digit equates to a number of lines, as many as the digit’s value.

The easiest approach is to center the group of lines. That means a single line, or any odd number of lines, has a line directly on the center, but even numbers of lines straddle the center.

So what we want, for each digit, is a list of offsets. We need to draw five lines for the digit 5, so a digit value of five must generate a list of five offsets. Five is odd, so those offsets center on zero.

If we’d like the lines to have a nominal separate of 1.0, it works out like this:

- [] (
*empty list*) - [0]
- [-0.5, +0.5]
- [-1.0, 0, +1.0]
- [-1.5, -0.5, +0.5, +1.5]
- [-2.0, -1.0, 0, +1.0, +2.0]
- [-2.5, -1.5, -0.5, +0.5, +1.5, +2.5]
- [-3.0, -2.0, -1.0, 0, +1.0, +2.0, +3.0]
- [-3.5, -2.5, -1.5, -0.5, +0.5, +1.5, +2.5, +3.5]
- [-4.0, -3.0, -2.0, -1.0, 0, +1.0, +2.0, +3.0, +4.0]

The actual line-spacing is factored (by a constant) when the image is drawn.

Here’s the code for generating the list of lists:

Span = lambda n,b: [float(b+x) for x in range(n)] Func = lambda n: Span(n,-(float(n-1)/2.0)) # Number of lines to draw... a_nlines = [Func(d) for d in a_digits] b_nlines = [Func(d) for d in b_digits] # Start location... a_start = float(a_len-1) / 2.0 b_start = float(b_len-1) / 2.0 border = 7.0 # Centerlines... a_axis = [x*(border/a_start) for x in Span(a_len,-a_start)] b_axis = [x*(border/b_start) for x in Span(b_len,-b_start)] #

Each list of digits generates a list of lists (`a_nlines`

and `b_nlines`

from `a_digits`

and `b_digits`

, respectively).

The meat is in the `Func`

function (a singularly uncreative name, I grant you; sometimes finding the right name just takes too long). It takes a numeric value and returns a list of offsets, as many as specified by the input value. It delegates most of the work to the Span function (that name was kinda obvious).

The `Span`

function takes a numeric value, ** n**, and a beginning value,

**. It just returns a list of**

*b***float values starting from**

*n***and increasing by one. The list of values is trivial — the trick in in calculating the start point.**

*b*The start location, along with the border and digit lengths, determine the two lists of center-lines, `a_axis `

and `b_axis`

.

**§**

All that remains is drawing the image.

I used the Python Pillow fork of the PIL package to create the PNG file. (I’d have to say I’m fan. I use it a lot!) It has drawing primitives, points, lines, rectangles, as well as text with fonts, so it’s pretty useful.

I have a wrapper class, Canvas, that creates a scaled drawing port. It allows me to use a coordinate system that matches the problem rather than one that matches the image. That class is too big to include here, but here’s the code that sets the values used:

dims = (400,400) xmin, xmax = float(-10.0), float(+10.0) ymin, ymax = float(-10.0), float(+10.0) view = ((xmin,xmax), (ymin,ymax)) c_line = (0x3f, 0x3f, 0xff) c_null = (0xdf, 0xbf, 0x7f) c_road = (0xff, 0xef, 0xbf) c_diag = (0xff, 0x00, 0x00) ln_spc = 3.2 border = 7.0 font0 = ImageFont.truetype('corbelb.ttf', size=17) font1 = ImageFont.truetype('arialbd.ttf', size=15) font2 = ImageFont.truetype('arial.ttf', size=14) #

These specify the image size (dims) and the coordinate system (view). The `c_line`

and similar variables specify the colors we’ll use. The `font#`

variables are for drawing the digits.

The image creation is very simple:

im = Canvas(dims, view) im.border([(0,0,0)], lw=1) # .. # .. do drawing stuff here .. # .. im.save(savename) #

This creates an image of size dims scaled per view. The second line adds a one-element black border (drawn with line width of 1). Once the *drawing stuff* is done, it’s just a matter of saving the image.

The drawing part gets slightly little involved. We’ll take it section by section. Since things we draw later cover things we draw earlier, the order of drawing different parts matters.

The diagonals should look like they’re “beneath” everything else, so we draw them first:

for ix in range(b_len-1): iy = (a_len - (b_len-ix)) ax = 0 if iy < 0 else iy bx = (iy-1) if iy < 0 else -1 p0 = (b_axis[ix], a_axis[-1]) p1 = (b_axis[bx], a_axis[ax]) im.line(p0, p1, c=c_diag, lw=1) for iy in range(1, a_len-1): ix = iy if iy < b_len else -1 ax = 0 if iy < b_len else iy-(b_len-1) p0 = (b_axis[0], a_axis[iy]) p1 = (b_axis[ix], a_axis[ax]) im.line(p0, p1, c=c_diag, lw=1) #

This was the hardest bit of code to work out, and it might be worth a post all on its own. Ultimately it ends up being fairly simple, but the contorted versions I tried for quite some time were pretty ugly.

Moving on, the next layer is the beige roads. Those are fairly straight-forward:

for ix,x in enumerate(b_axis): p0 = (x, -9.0) p1 = (x, +9.0) im.line(p0, p1, c=c_road, lw=21) s = str(b_digits[ix]) im.text((x-0.17, +9.9), s, font1, c=(0,0,0)) for iy,y in enumerate(a_axis): p0 = (-9.0, y) p1 = (+9.0, y) im.line(p0, p1, c=c_road, lw=21) s = str(a_digits[iy]) im.text((-9.7,y+0.40), s, font1, c=(0,0,0)) #

The canvas extends from -10.0 to +10.0 on both axes. The roads extend from -9.0 to +9.0 along each center-line. Note that the “road” is just a line with a very fat width of 21.

While we draw the roads, we also draw the factor digits along their respective edges. (Again we assume the -10.0 to +10.0 canvas.)

Next come the lines:

for ix,x in enumerate(b_axis): ns = b_nlines[ix] if len(ns): for n in ns: p0 = (x+(n/ln_spc), -9.0) p1 = (x+(n/ln_spc), +9.0) im.line(p0, p1, c=c_line, lw=2) else: p0 = (x, -9.0) p1 = (x, +9.0) im.line(p0, p1, c=c_null, lw=3) for iy,y in enumerate(a_axis): ns = a_nlines[iy] if len(ns): for n in ns: p0 = (-9.0, y+(n/ln_spc)) p1 = (+9.0, y+(n/ln_spc)) im.line(p0, p1, c=c_line, lw=2) else: p0 = (-9.0, y) p1 = (+9.0, y) im.line(p0, p1, c=c_null, lw=3) #

Note the special handling of empty lists, which represent the digit **0**.

Note also that, as with the roads, the lines extend from -9.0 to +9.0 across the image. The parallel their center-line axis adjusted by the offset.

One last section to draw the group counts (which overlie the lines):

for ix,x in enumerate(b_axis): for iy,y in enumerate(a_axis): a = a_digits[iy] b = b_digits[ix] im.text((x,y), str(a*b), font2, c=(0,0,0), bg=(255,255,255)) s = '%d x %d = %d' % (a_nbr,b_nbr,c_nbr) im.text((-9.0,-9.1), s, font0, c=(255,0,0)) #

Those last lines draw the multiplication and product along the bottom edge.

And that, almost surprisingly, is all there is to it.

§

Two things remain. Firstly, I’d like better spacing when there are only two digits. Right now, the two place at the outside edges. They should be closer in.

Secondly, rotation. I’m thinking of a version that generates the points, transforms them through a rotation matrix (or using a quaternion) and does the drawing with the transformed points. It’s all just point-to-point lines, so it should work fine. Then I’ll have images that look like the Japanese method.

∅

Wyrd Smythe

said:Okay, the rotation part turned out to be super easy:

I just added a rotation matrix and a function to translate coordinate points.

Two extra lines of code (three including the matrix class import line), and adding a function name in front of what were already pairs of coordinates in parenthesis. The function takes a pair of XY coordinates and returns a transformed tuple.

Now about the two-digit spacing…