oh lol, didnt see the links, i was searching the whole black text for info on that
oh lol, didnt see the links, i was searching the whole black text for info on that
signature under construction
The only odd thing I found is that the article mentions "8 neighbors" but that screwifies things when an electron approaches a corner (you end up with 2 heads in a row). It seems to work much better when you only count the neighbors at the sides (and not the corners).
If you understand what you're doing, you're not learning anything.
ok, just to make that sure:
so my question is if those overlaps are allowed - maybe im thinking too much about nibbles where that would be a crashCode:TE WWW TE turns into: WT EWW WT (so the two electrons eventually overlap) and the case TE EWW WT turns into WT EEW WW so one tail is overlapped by a head?
signature under construction
ah i think now i understood what they meant by "with the number u..."
signature under construction
Your second one is wrong. You should've had
Code:TE WT EWW => TEW WT WW
System: Debian Sid and FreeBSD 7.0. Both with GCC 4.3.
Useful resources:
comp.lang.c FAQ | C++ FQA Lite
yeah, well it was late yesterday - i've already implemented the rules on site that was linked to
signature under construction
Can we get some clarification on whether to use 4 neighbors or 8 neighbors for the simulation when determining which pieces of wire turn into electron heads?
8 neighbors works fine for 45 degree turns in the wire, but when there's a 90 degree turn like in the example file you end up with 2 electron heads in a row.
Last edited by itsme86; 08-24-2006 at 09:38 AM.
If you understand what you're doing, you're not learning anything.
The animations on the Wolfram site show multiple electron heads at various points.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
A gun that keeps firing
Code:delay=5 .............................. ..WWWWWWTE.................... .W........WWWWWWWWWWWWWWWWWWW. ..WWWWWWWW.................... ..............................
If you understand what you're doing, you're not learning anything.
it's a clock, not a gun.
Code:#include <cmath> #include <complex> bool euler_flip(bool value) { return std::pow ( std::complex<float>(std::exp(1.0)), std::complex<float>(0, 1) * std::complex<float>(std::atan(1.0) *(1 << (value + 2))) ).real() < 0; }
Okay, this is fun so I've been going kind of nuts with this stuff. A really ugly adder:
Red = Input bitsCode:delay=0 .................................... ..WWWWWW............................ .W......W........................... ..WWWW...W.......................... ......W...W......................... ..TEWW.....WWWWWWWWWW............... ....W................W.............. ...W....WWWWWW......WWW.WWWWWWWWWWW. ..W....W......W.....W..W............ .W......WWWW...W.....WWW............ .W..........W...W.....W............. .W.TEWWWWWWW.....WWWWW.............. .W........W...............WWWWWWWWW. .W.....WWW..WWW..........W.......... ..W...W....W...WWWW.....W........... ...W...WWWW..W.W...W...W............ ....W.......WWW..W.W..W............. .....WWWWWWW.W.WWWW..W.............. .................W.WW............... ....................................
Blue = Result
Green = Carry
Definitely open to suggestions and critisicm.
If you understand what you're doing, you're not learning anything.
nice! keep this up and we'll have a whole catalogue of circuits by contest end. =) care to make a full adder now?
Code:#include <cmath> #include <complex> bool euler_flip(bool value) { return std::pow ( std::complex<float>(std::exp(1.0)), std::complex<float>(0, 1) * std::complex<float>(std::atan(1.0) *(1 << (value + 2))) ).real() < 0; }
Okay, I guess I'll have to learn how to use ncurses if I want to participate. It's about time I did anyway.
dwk
Seek and ye shall find. quaere et invenies.
"Simplicity does not precede complexity, but follows it." -- Alan Perlis
"Testing can only prove the presence of bugs, not their absence." -- Edsger Dijkstra
"The only real mistake is the one from which we learn nothing." -- John Powell
Other boards: DaniWeb, TPS
Unofficial Wiki FAQ: cpwiki.sf.net
My website: http://dwks.theprogrammingsite.com/
Projects: codeform, xuni, atlantis, nort, etc.
So you all need a premade map? I know of one, but instead of being 80 by 24 its 631 by 958.
Enjoy.
Here's a shortened version of a binary counter, if that's of any interest.
Code:delay = 10 ......WWWWWWW...........WWWWWWW...........WWWWWWW...........WWWWWWW...........WWWWWWW...........WWWWWWW............ .....W.......W.........W.......W.........W.......W.........W.......W.........W.......W.........W.......W........... .....W.W......W........W.W......W........W.W......W........W.W......W........W.W......W........W.W......W.......... ......WWW......WW.......WWW......WW.......WWW......WW.......WWW......WW.......WWW......WW.......WWW......WW........ .....W.W.WWW.....W.....W.W.WWW.....W.....W.W.WWW.....W.....W.W.WWW.....W.....W.W.WWW.....W.....W.W.WWW.....W....... ....W....W..W....W....W....W..W....W....W....W..W....W....W....W..W....W....W....W..W....W....W....W..W....W....... ...W....WWW..W...W...W....WWW..W...W...W....WWW..W...W...W....WWW..W...W...W....WWW..W...W...W....WWW..W...W....... ....WWW.W.WWWWW..W....WWW.W.WWWWW..W....WWW.W.WWWWW..W....WWW.W.WWWWW..W....WWW.W.WWWWW..W....WWW.W.WWWWW..W....... .......WW.W..W..WWWW.....WW.W..W..WWWW.....WW.W..W..WWWT.....WW.W..W..WWWW.....WW.W..W..WWWW.....WW.W..W..WWWWWWWW. .WWWWWW.WW.W.W...W..WWWWW.WW.W.W...W..WWWWW.WW.W.W...W..EWWWW.WW.W.W...W..WWWWW.WW.W.W...W..WWWWW.WW.W.W...W......W W.....W....W..WWW.......W....W..WWW.......W....W..WWW.......W....W..WWW.......W....W..WWW.......W....W..WWW.......W W.....W...W..W..........W...W..W..........W...W..W..........W...W..W..........W...W..W..........W...W..W..........W W.....W..WWW.W..........W..WWW.W..........W..WWW.W..........W..WWW.W..........W..WWW.W..........W..WWW.W..........W W....W....W..W.........W....W..W.........W....W..W.........W....W..W.........W....W..W.........W....W..W..........W W.....WWWW.W.W..........WWWW.W.W..........WWWW.W.W..........WWWW.W.W..........WWWW.W.W..........WWWW.W.W..........W W..........W.W.WWWW..........W.W.WWWW..........W.W.WWWW..........W.W.WWWW..........W.W.WWWW..........W.W.WWWW.....W W..........W..W....W.........W..W....W.........W..W....W.........W..W....W.........W..W....W.........W..W....W....W W..........W.WWW..W..........W.WWW..W..........W.WWW..W..........W.WWW..W..........W.WWW..W..........W.WWW..W.....W W..........W..W...W..........W..W...W..........W..W...W..........W..W...W..........W..W...W..........W..W...W.....W W.......WWW..W....W.......WWW..W....W.......WWW..W....W.......WWW..W....W.......WWW..W....W.......WWW..W....W.....W W......W...W.W.WW.WWWWW..W...W.W.WW.WWWWW..W...W.W.WW.WWWWW..W...W.W.WW.WWWWW..W...W.W.WW.WWWWW..W...W.W.WW.WWWWWW. .WWWWWWWW..W..W.WW.....WWWW..W..W.WW.....WWWW..W..W.WW.....WWWW..W..W.WW.....WWWW..W..W.WW.....WWWW..W..W.WW....... .......W..WWWWW.W.WWW....W..WWWWW.W.WWW....W..WWWWW.W.WWW....W..WWWWW.W.WWW....W..WWWWW.W.WWW....W..WWWWW.W.WWW.... .......W...W..WWW....W...W...W..WWW....W...W...W..WWW....W...W...W..WWW....W...W...W..WWW....W...W...W..WWW....W... .......W....W..W....W....W....W..W....W....W....W..W....W....W....W..W....W....W....W..W....W....W....W..W....W.... .......W.....WWW.W.W.....W.....WWW.W.W.....W.....WWW.W.W.....W.....WWW.W.W.....W.....WWW.W.W.....W.....WWW.W.W..... ........WW......WWW.......WW......WWW.......WW......WWW.......WW......WWW.......WW......WWW.......WW......WWW...... ..........W......W.W........W......W.W........W......W.W........W......W.W........W......W.W........W......W.W..... ...........W.......W.........W.......W.........W.......W.........W.......W.........W.......W.........W.......W..... ............WWWWWWW...........WWWWWWW...........WWWWWWW...........WWWWWWW...........WWWWWWW...........WWWWWWW......
Last edited by SirNot; 09-17-2006 at 01:22 AM.
