# Wanted *beta testers*

페이지 8/9
1 | 2 | 3 | 4 | 5 | 6 | 7 | | 9

evulopah, aren't you going to Nijmegen, then?
RyJuZo will be our neighbour there.

evulopah, aren't you going to Nijmegen, then?
RyJuZo will be our neighbour there.

Not anymore by the looks of it :)
*notes a strikethrough*

Dammit!

Haha... too bad, still no evidence except for those few screenshots!

But I'm sorry John, I mean Demonseed, for not attending @ the fair in Nijmegen! Maybe next year together with jel.. I mean Meits!

IIRC
they told they want to present the game to the passion msx contest.
I'm sure sooner or later they will show the rom.
Moam has eternal delays, but never the less it is still under development

*PS* How long it should take until some HUMBLE z80 coder copy & paste here some nice z80 asm code that calculates pi digits?
Simple!

1) Measure the area of a disc
2) start up an assembler, and divide the area by the squared radius of the disc!
3) result = PI

(not sure about the amount of floating point digits you get, but what the heck )

hummm
the area need some Eulero formula... it cannot expand the digits easily

a better way is this
http://en.wikipedia.org/wiki/Buffon%27s_needle

once you implement the hitting code you can run it as many times as you like

In the end the result comes from one single division between the number of tries and teh number of hits

If you need 100 digits you have to implement one single 100 digit division

If you do not want a method with variable precision, this is a good way

```db "3,1415926535897932384626433832795"
```

;P

There is a debate over who "invented" or found PI , because before greeks , ancientegyptian were using the 22/7 ratio , which is fairly a good approx.

*PS* How long it should take until some HUMBLE z80 coder copy & paste here some nice z80 asm code that calculates pi digits?
Z80 asm? Why? BASIC is enough for that:

`PRINT ATN(1)*4`

Please send me the math nobel prize by email. Thanks.

페이지 8/9
1 | 2 | 3 | 4 | 5 | 6 | 7 | | 9