# Pinhole Photographs MMXVII

2017-05-06, post № 169

**art**, #light, #nature, #photography, #picture, #tulip, #World-Wide Pinhole Day, #WWPD

2017-05-06, post № 169

**art**, #light, #nature, #photography, #picture, #tulip, #World-Wide Pinhole Day, #WWPD

2017-04-22, post № 168

**Java**, **mathematics**, **programming**, #animated gif, #animation, #Cartesian, #complex, #complex arithmetic, #fractal, #generalization, #gif, #Mandelbrot set, #multi-threading, #polar, #reals, #threading

The Mandelbrot Set is typically defined as the set of all numbers for which — with , and — the limit converges. Visualizations of this standard Mandelbrot Set can be seen in three of my posts (Mandelbrot Set, Mandelbrot Set Miscalculations and Mandelbrot Set II).

However, one can extend the fractal’s definition beyond only having the exponent 𝟤 in the function to be with ^{ [1]}. The third post I mentioned actually has some generalization as it allows for , although the approach used cannot be extended to real or even rational numbers.

The method I used in the aforementioned post consists of manually expanding for each 𝑛. The polynomial , for example, would be expanded to .

This method is not only tedious, error-prone and has to be done for every exponent (of which there are many), it also only works for whole-number exponents. To visualize real Multibrots, I had to come up with an algorithm for complex number exponentiation.

Luckily enough, there are two main ways to represent a complex number, Cartesian form and polar form . Converting from Cartesian to polar form is simply done by finding the number’s vector’s magnitude and its angle to the 𝑥-axis . *(The function is used in favor of to avoid having to divide by zero. View this Wikipedia article for more on the function and its definition.)*

Once having converted the number to polar form, exponentiation becomes easy, as

With the exponentiated in polar form, it can be converted back in Cartesian form with

Using this method, converting the complex number to perform exponentiation, I wrote a Java program which visualizes the Multibrot for a given range of exponents and a number of frames.

Additionally, I added a new strategy for coloring the Multibrot Set, which consists of choosing a few anchor colors and then linearly interpolating the red, green and blue values. The resulting images have a reproducible (in contrast to randomly choosing colors) and more interesting (in contrast to only varying brightness) look.

The family of Multibrot Sets can also be visualized as an animation, showing the fractal with an increasing exponent. The animated gif shown below was created using ImageMagick’s `convert -delay <ms> *.png multibrot.gif`

command to stitch together the various `.png`

files the Java application creates. To speed up the rendering, a separate thread is created for each frame, often resulting in 𝟣𝟢𝟢％ CPU-usage. *(Be aware of this should you render your own Multibrot Sets!)*

To use the program on your own, either copy the source code listed below or download the `.java`

file. The sections to change parameters or the color palette are clearly highlighted using block comments (simply search for `/*`

).

To compile and execute the Java application, run (on Linux or MacOS) the command `javac multibrot.java; java -Xmx4096m multibrot`

in the source code’s directory (`-Xmx4096m`

tag optional, though for many frames at high quality it may be necessary as it allows Java^{ [2]} to use more memory).

If you are a sole Windows user, I recommend installing the Windows 10 Bash Shell.

Source code: multibrot.java

2017-04-16, post № 167

**art**, **ascii**, **haiku**, **poetry**, #ascii egg, #celebration, #easter egg, #egg

Winds swirl through the air,

Water sloshes at the shore;

A peaceful island.

vunnnnnnnxvvczYX uuxrjjft///tfjrnuvvcXXUU cuxxrf/\|(|||/tttrnxuuvcczYYJL cuuvnxrjt/\\\/\//tffrxnuvvcccXXYYCLC cccvuunxjrttttttjjfrrxnnnvvcczXzXUUUJL0 cczvvvuuuxnrxrrrjrxrxnnuuuvvcczXXXXYXUJJLQZ czzzXzvccvnuunnnnnnnnuuuvuvvccczzzXYXYUYUJCLQO zzzzXzccvvvvvuunnnnunuunnuuucvzczzXXYXUYJUJJCQ0Oq XXXXzzzzcccvvvvuuvunnnnnuuuvvvcczzXzXYXXYYUUCCL0Qmp XXXzXzzzzzcccccvuunnnnnnnnunvucvzzzXzYXXYUUUUJJCL0OZq XYYYYXXzczzzcczcvuuunxxnxxxnuuuvzzXXXXYXUYUUUUUCJCQ0Owp YYUYXYYXXXXzczczcvvuunxxrrrxnnuvuzzzzXXXYYUUUUUUJJCCL0Omd YYUUYUYUXXXXczzzzcvvvunxrxrrrxxnuvcczzXzYYXYXUYUUJJLQQ0OZmk YUUJJJYUYYXUXYXzczzczuuxrjrrrjrxxccccczzXXXYUYUYUJUCCCL00mwdw UJCJJJUYXYXXXzzXXzzvvnxxrjjjrjxxuvvczXzXYYYXXUYUUUJCJLLL0Zmpb CLLCJJJCUUUXUUXXzzzccvvunxxrrxrnuuvzzzXYXXYYYUUUYJUJJJJLL0OZwda QLQLCJCUUUUUUYYXXXXXzvuuxxxrrnxxuuvvccXzXYUYUYYYUUUUCCCLLQ0Zmpk 00QQLLLCUJUUUUUYYYXzzzccvuuxxxxnnuvczzcXXXXUUUUYYJUYUUJCLL0QOwqk* Z0OQQLLJCJUUUYUYYYXXXzzcvvnunnuuvvvvczzzXXXYYYYUYUYUJJCJLL0QOmqpa 0ZmZ00QLLCCJCJUUUUYYXXzzcccvvuuuucvczXXXYXYYUUUYYYUUUJJJJC0L0ZOqpkM ZOZO0QLLLCCCJJJUUYYXYXXYXzccvvccvczzzzXXXYYYYYUYYUYUUUUJJCCQQOZwdk* wwmZ0OQCQCCJJJJUUUYUYYYYXXzzzcccczXXXzXXXXYYXUYYYUUJUUJJCULQQ0Zmpbo qmZZZ00QQLCJUJUUJUUUUUYYXXXXzcYXXzXUXYXYYYXUUUYUUUUUUUJCJCCQQOZmqb# dqpZZ00QQLLLLCCJJCUUUYUYUYUXYXYYYYYYYYYYUYYUYUYYUUUYUUUJJLLQ0Omwqb* qpqwZZOO0QLQCCCJCUJYUUUUUUYXXYYYUUUUYUYYUYJUYUYUYYYUUUJJJULLQ00mwqba pddpwmZ000QQCQCCLCJJCJUUJUJUUUUUUYUYJUUUUUYUYJUJUUUJUJUUCCLLQ0OOmpba qkppwwmOOO0LQLLCCCCJJJJJJUJJJUCJUUUUUUUUUJUJJUJUJUUJUCCCCCLQ00OZqqh* kdbpmmZZO00QQQLQLCCCJCCUCJJJUJCUJJUUUUUJJUUUUJJYUJUUJJJCLLL00OZwqk# ahbdqwmmOZ0Q00LLLJCCCJJJCJJJJJCUJJJYUUJUUUUUUUUUUUJUJCJCLLQOQZmqdh# oohdqwwZZOO0QQLLQLQCCCCLLCLCCJJJJCUJUJJJJUUUUYUJJJCCCCCCCQ0OOmmpk#* d*abdqqwmmOOZ00OQLQ0LCLQCCCJCLCCCJCCJJUUUJUJUUJUJUJCCCCLCQOOmwpdh# M#hkbqwmZmZOOO0Q00L0QLCLLQLLQLJCLCCJJCJCUJJJJJJJJCJJLLCQ0ZmwqpkaM oohkddqwmmmOZOOO0LQL0LLQCL0LCLLLLLCJCJLJJJUUJJJJCCCLQ00OZmwqba* WM*akbqppwmwZOZOQOO000LQLQQLCCLLLCCCCJJCCCCJCJCLCCCLQ0OZmppboo MWohhdpwqwwmwOZZZOOO00QLQLQQLLLLLCCCLLLCLCLCLLJLLQ0ZOmmwdbaa &W#hkbpqwqwqZZZZZZO000QQQ0QLLQLCLLCQCLQLLLLCLLQQL0ZZmwpbkap 8&#ohkbddpqwwmmmZOZOOO0OO0Q0Q0QLLQQLQLLQQ0QQQ00ZOmmqbdha 88WMohobdbpqpwwmqZZmZZZOQZO000Q0OQQQ00QQQ000OZmmqppkk* M%8M#*okkbppdqqppmwZmmmwOOZZOO00O0O0O0O0OmZqqwqdbkho B@8&M**ohkbbdqppqwqwwwwwZZZmZmOOOOOZZmmwwppbbkka @@8&MW*ookkkbdpdpdqpqqwqpwZwZwwmqwqpppdpdkk* $$%%&WM#*oahkkhkddppdpbqwpppppbpdkkbbhho @$@B8&WM**#aoaahbkkhkhkbbkkbhhkhkkab $@%%8&WWM#M#*o**oooaoooaaaaook @%%W&WWW#*##o*oa#**#M* #88&&%8%&

Extra assets: easter-mmxvii_development_asciify.py, easter-mmxvii_development_egg-2.png, easter-mmxvii_development_egg-2.txt, easter-mmxvii_development_egg-38.JPG, easter-mmxvii_development_egg-38_turned-2.jpg, easter-mmxvii_development_egg-38_turned.jpg, easter-mmxvii_development_egg-42.JPG, easter-mmxvii_development_egg.jpg, easter-mmxvii_development_egg.txt

2017-04-08, post № 166

**games**, **HTML**, **JavaScript**, **mathematics**, **programming**, **Python**, #computer player, #game ai, #perfect, #perfect play, #three in a row, #three to win, #three

Tic-Tac-Toe, noughts and crosses, Xs and Os, three in a row or whatever you want to call it may be the simplest perfect information game that is enjoyable by humans. Two players set their pieces (X or O) on an 𝟥 ⨉ 𝟥 grid, alternating their turns. The first player to get three of their pieces in a line, wins. If no player succeeds to get a line, the game ends in a draw.

Tic-Tac-Toe’s simplicity may become clear, if you consider that skilled players — people who have played a few rounds — can reliably achieve a draw, thereby playing perfectly. Two perfect players playing Tic-Tac-Toe will — whoever starts — always tie, so one may call the game virtually pointless, due to there practically never being a winner.

Because of its simple rules and short maximal number of turns (nine) it is also a game that can be solved by a computer using brute-force and trees.

The first Tic-Tac-Toe-playing program I wrote is a Python shell script. It lets you, the human player, make the first move and then calculates the best possible move for itself, leading to it never loosing. On its way it has a little chat whilst pretending to think about its next move. The Python source code can be seen below or downloaded here.

The second Tic-Tac-Toe-playing program I wrote uses the exact same method of optimizing its play, though it lets you decide who should begin and is entirely written in JavaScript. You can play against it by following this link.

Both programs look at the entire space of possible games based on the current board’s status, assumes you want to win and randomly picks between the moves that either lead to a win for the computer or to a draw. I did not include random mistakes to give the human player any chance of winning against the computer. Other Tic-Tac-Toe-playing computers, such as Google’s (just google the game^{ [1]}), have this functionality.

Source code: t-3po.py

Extra assets: t-3po_development_t-3po.html

2017-03-28, post № 165

**art**, #2 years, #celebration, #collage, #j, #J-Blog, #jblog, #two years

J-Blog celebrates its second anniversary!

Exactly two years ago, on the twenty-eighth of March 2015, the very first post on this blog appeared, appropriately named “Hello World”. Since then, including this one, 𝟣𝟨𝟦 other posts have been posted. Here a few of the image highlights from both years, with their corresponding post.

- ?][)0Zqpkdc QmphM&88888%av Z&88%%%8M*%B8X JW&Mbw\1] ZB@b ?- #BB%c m@@@kc ?o@BBC ]&@@*v L%@%Y o@BZ LB@a ]%BM? *B&v k%&v mBWv wBWv ZB* w@O W8z [BO ao] Ckc k&z b@#Z? [a8L X%$@*Q[? ?[q%&} {&%%8&kwm00mdM%%w? ?ZW8%%%%%%B8&q] -}\wpkpft[

Extra assets: second-anniversary_j-sketch-1.png, second-anniversary_j-sketch-2.png, second-anniversary_j-sketch-3.png, second-anniversary_j-sketches-1.jpg, second-anniversary_j-sketches-1.nef, second-anniversary_j-sketches-2.jpg, second-anniversary_j-sketches-2.nef, second-anniversary_j-sketches-2.xmp

2017-03-25, post № 164

**mathematics**, **PIL**, **programming**, **Python**, #alpha, #chaos, #chaos theory, #delta, #Feigenbaum, #fractal, #iterations, #Mandelbrot set, #modelling, #population

Generating the famous fractal, which can be used to model populations with various cycles, generate pseudo-random numbers and determine one of nature’s fundamental constants, the Feigenbaum constant 𝛿.

The fractal nature comes from iteratively applying a simple function, with , and looking at its poles.

The resulting image looks mundane at first, when looking at , though the last quarter section is where the interesting things are happening (hence the image below only shows the diagram for ).

From 𝜆 = 𝟥 on, the diagram bifurcates, always doubling its number of poles, until it enters the beautiful realm of chaos and fractals.

For more on bifurcation, fractals and 𝛿, I refer to this Wikipedia entry and WolframMathworld.

Source code: bifurcation-diagram.py

2017-03-14, post № 163

**mathematics**, **programming**, **Python**, #approximation, #dimensions, #four, #four dimensions, #generator, #higher dimensions, #hyperspheres

Every year on March the 14th, for one day the world gets irrationally excited about the famous constant 𝜋. As is tradition, you try to calculate 𝜋 in unusual ways, demonstrating the constant’s ubiquity as it crops up in the most unexpected circumstances.

lnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnn nJ$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$w `v$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ n$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$z u$$mnn: Y$$$i .@$$$$$, $$n )$$$* W$$$$$m -n[ $$$$. ]$$$$$$ h$$$w $$$$$$Y [$$$$ X$$$$$$ "$$$$n '$$$$$${ .$$$$$ 8$$$$$$ *$$$$} :$$$$$$+ #$$$$u $$$$$$% t$$$$$$ ;$$$$$$` u$$$$$$! $$$$$$W Y$$$$$$M .$$$$$$, f$$$$$$$$. Z$$$$$Z nn `w$$$$$$$$| $$$$$$( v$z n$$$$$$$$$W $$$$$$$1 'X$8 Y$$$$$$$$$$ *$$$$$$$8nnnn$$$p $$$$$$$$$@. W$$$$$$$$$$$$$n _$$$$$$${ x$$$$$$$$$0> -n{. !|nt_.

A fairly well-known way to approximate 𝜋 is to randomly choose points in a square (often thought of as throwing darts at a square piece of cardboard), determine their distance to a circle’s center and do a division, as I did in my 𝜋 Generator post.

However, 𝜋 does not only appear in the formula for a circle’s area, , yet^{ [1]} also in the formula for a sphere’s volume, , and for all the infinite hyperspheres above dimension three (view this Wikipedia article for more about volumes of higher-dimensional spheres).

In particular, the formula for the hypervolume of a hypersphere in four dimensions is defined as being . Using this formula, my Python script randomly chooses four-dimensional points (each in the interval ), calculates their distance to the point and determines if they are in the hypersphere around that point with radius 𝟢.𝟧.

By dividing the number of random points which lie in the hypersphere by the number of iterations used ( in the example below), the script approximates the hypersphere’s hypervolume. By then rearranging the equation with 𝑟 = 𝟢.𝟧 to , the desired constant can be approximated.

$ python pi.py 3.14196371717

Source code: pi-day-mmxvii.py

2017-03-11, post № 162

**mathematics**, **programming**, **Python**, #2016, #decimal reverse, #difference, #integer, #OEIS, #On-Line Encyclopedia of Integer Sequences, #palindrome, #reverse, #sequence, #square

The On-Line Encyclopedia of Integer Sequences (also known by its acronym, OEIS) is a database hosting hundreds of thousands of — as the name implies — integer sequences. Yet, despite the massive number of entries, I contributed a new integer sequence, A278328.

A278328 describes numbers whose absolute difference to their decimal reverse are square. An example would be 𝟣𝟤 or 𝟤𝟣 (both are the decimal reverse to each other), since and .

Not a whole lot is known about the sequence^{ [1]}, partly due to its definition only resulting in the sequence when using the decimal system, though it is known that there are infinitely many numbers with said property. Since there are infinitely many palindromes (numbers whose reverse is the number itself), and .

Due to there — to my knowledge — not being a direct formula for those numbers, I wrote a Python script to generate them. On the sequence’s page, I posted a program which endlessly spews them out, though I later wrote a Python two-liner, which only calculates those members of the sequence in the range from 𝟢 to 𝟫𝟪 (shown below entered in a Python shell).

>>> import math >>> filter(lambda n:math.sqrt(abs(n-int(str(n)[::-1])))%1 == 0, range(99)) [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15, 21, 22, 23, 26, 32, 33, 34, 37, 40, 43, 44, 45, 48, 51, 54, 55, 56, 59, 62, 65, 66, 67, 73, 76, 77, 78, 84, 87, 88, 89, 90, 95, 98]

Jonathan Frech's blog; built 2021/10/02 17:36:09 CEST