Page 2333 of 2688

Time Revisited – np2237

Posted: Sun Jun 21, 2015 8:27 am UTC
by Sustainabilizer
UNG YOU OK?
Image
Spoiler:
Wait for it.
Yay, Popebot! Bow for your robot overlord! Image Ch*rp, unexpected Sustainapope. Decree: celebrate the UNGs and the revealing of new details in Time, t1i, and BFTF – by UNGing oldpix, or by other OTTish means. Also, check for previously undetected molpies. I wonder how many OTTers will actually really read this decree, and how many will just assume that it's oldpixbot's decree.

OTT Time Travel

RELATED News wrote:

-- posted by Sustainabilizer

Re: 41*29+1: "Time"

Posted: Sun Jun 21, 2015 9:54 am UTC
by balthasar_s
It's all related.
In this:
Spoiler:
Image

Under the frames you can see some paper with some writings.
What are they?
I was figuring out how to convert between coordinate systems which can be moved, rotated.
I needed it for a Colobot AI:

Code: Select all

public class path
{
   float xr,yr,ar,cosar,sinar; //coordinate system
   int ib,jb; //map dimensions
   float db; //map cell width
   int ir,jr; //start position on map
   int ig,jg; //goal position on map
   bool bitmap[][]; //point free=true, occupoie=false
   int statemap[][]; //point state: closed-2, open-1, 0-unvisited
   int dirmap[][]; //direction to prev. point: 0-no, 1-i-, 2-j-, 3-i+, 4-j+
   //int valmap[][]; //dist. to goal + dist. from start
   int stepmap[][]; //dist from start;
   
   point wp[]; //list of waipoints
   int wpi; //current waypoint index
   int wps; //number of waypoints
   object bot; //the robot
   object target; //the target
   
   int followcount;

   //coordinate conversions:
   point map2abs(int i,int j)
   {
      float x=(i-ir)*db;
      float y=(j-jr)*db;
      point q(xr+x*cosar-y*sinar,yr+x*sinar+y*cosar);
      return q;
   }
   
   point rel2abs(point p)
   {
      point q(xr+p.x*cosar-p.y*sinar,yr+p.x*sinar+p.y*cosar);
      return q;
   }
   
   point rel2abs(float x, float y)
   {
      point q(xr+x*cosar-y*sinar,yr+x*sinar+y*cosar);
      return q;
   }
   
   point abs2rel(point p)
   {
      point q((p.x-xr)*cosar+(p.y-yr)*sinar,(p.y-yr)*cosar-(p.x-xr)*sinar);
      return q;
   }
   
   point abs2rel(float x, float y)
   {
      point q((x-xr)*cosar+(y-yr)*sinar,(y-yr)*cosar-(x-xr)*sinar);
      return q;
   }
   
   point abs2map(float x, float y)
   {
      point q(((x-xr)*cosar+(y-yr)*sinar)/db+ir,((y-yr)*cosar-(x-xr)*sinar)/db+jr);
      return q;
   }
   
   point abs2map(point p)
   {
      point q(((p.x-xr)*cosar+(p.y-yr)*sinar)/db+ir,((p.y-yr)*cosar-(p.x-xr)*sinar)/db+jr);
      return q;
   }
   
   //adjust motor settingsm follow the waypoints
   void followpath()
   {
      float a;
      if(wpi>=0)
      {
         //message(wpi+" "+wp[wpi]);
         //message(""+bot.position);
         a=direction(wp[wpi]);
         if(distance2d(bot.position,wp[wpi])<(db*1.6))
         {
            --wpi;
            //message(wpi+""+wp[wpi]);
         }
         if(a<0)
         {
            if(a<-90)
               motor(1,-1);
            else
               motor(1,cos(2*a));
         }
         else
         {
            if(a<90)
               motor(cos(2*a),1);
            else
               motor(-1,1);
         }
      }
      else
         motor(0,0);
   }
   
   void path(point p, float a, float d, int s, int f, int b, object r, object t, point tp)
   {
      //p - coordinate system center
      //a - c.s. angle
      //d - c.s. unit
      //s - width to the sides
      //f - widht to the front
      //b - width to the back
      //r - the robot
      //t - target (object)
      //tp - target position
      point ijg;
      float dir1;
      
      followcount=5;
      
      xr=p.x;
      yr=p.y;
      ar=a;
      cosar=cos(ar);
      sinar=sin(ar);
      jb=2*s+1;
      ib=f+b+1;
      jr=s;
      ir=b;
      db=d;
      bot=r;
      target=t;
      
      ijg=abs2map(tp);
      ig=ijg.x+0.5;
      jg=ijg.y+0.5;
      
      if(ig<0 || ig>=ib || jg<0 || jg>=jb)
      {
         ig-=ir;
         jg-=jr;
         
         if(ig>0)
            dir1=jg*f/s;
         else
            dir1=jg*b/s;
         
         if(abs(dir1)>s)
         {
            ig=(ijg.x-ir)*s/abs(ijg.y-jr)+0.5+ir;
            if(ig<0)
               ig=0;
            else if(ig>=ib)
               ig=ib-1;
            if(jg>0)
               jg=jb-1;
            else
               jg=0;
         }
         
         else
         {
            if(ig>0)
            {
               jg=(ijg.y-jr)*f/abs(ijg.x-ir)+0.5+jr;
               ig=ib-1;
            }
            else
            {
               jg=(ijg.y-jr)*b/abs(ijg.x-ir)+0.5+jr;
               ig=0;
            }
            if(jg<0)
               jg=0;
            else if(jg>=jb)
               jg=jb-1;
         }
      }
      
      wpi=-1;
      wps=0;
   }
}

//the open set
public class pf_front
{
   int count;
   int last;
   int best;
   int i[];
   int j[];
   int value[];
   int dist[];
   int next[];
   
   void pf_front()
   {
      count=0;
      last=-1;
      best=-1;
   }
   
   void takebest()
   {
      if(count>0)
      {
         count--;
         best=next[best];
      }
   }
   
   void addpoint(int ii, int jj, int val, int dis)
   {
      int pr, nx; //previous point and next point;
      if(count==0)
      {
         count=1;
         last=0;
         i[0]=ii;
         j[0]=jj;
         value[0]=val;
         dist[0]=dis;
         next[0]=-1;
         best=0;
         return;
      }
      nx=best;
      for (int k=0; k<count; ++k)
      {
         if(val<=value[nx])
         {
            last++;
            count++;
            i[last]=ii;
            j[last]=jj;
            value[last]=val;
            dist[last]=dis;
            next[last]=nx;
            if(k==0)
               best=last;
            else
               next[pr]=last;
            return;
         }
         pr=nx;
         nx=next[pr];
      }
      last++;
      count++;
      i[last]=ii;
      j[last]=jj;
      value[last]=val;
      dist[last]=dis;
      next[last]=-1;
      next[pr]=last;
   }
}

public class pathfinder
{
   int size[];
   float path_d;
   float path_f;
   float path_s;
   float path_b;
   object bot;
   float botwidth;
   object target;
   point targpos;
   int noprogress;
   int maxnoprogress;
   int followcount;
   
   path currentpath;
   path nextpath;
   pf_front front;
   
   void pathfinder(float d, float s, float f, float b, object r, object t, point tp) //main class
   {
      //d - c.s. unit
      //s - width to the sides
      //f - widht to the front
      //b - width to the back
      //r - the robot
      //t - target (object)
      //tp - target position
      
      botwidth=1.1; //how much to add to object's size
      maxnoprogress=72;  //how many subiterations without progress
      followcount=2; //how often adjust motors
      
      bot = r;
      path_d=d;
      path_s=s;
      path_f=f;
      path_b=b;
      target=t;
      targpos=tp;
      
      for(int i=0;i<999;++i)
      {
         size[i]=0;
      }
      //sizes of all objects
      {
         size[2]=18;
         size[2]=18;
         size[4]=3;
         size[5]=5;
         size[6]=6;
         size[7]=5;
         size[8]=5;
         size[9]=2;
         size[10]=1;
         size[11]=3;
         size[12]=2;
         size[13]=3;
         size[14]=5;
         size[15]=6;
         size[16]=0;
         size[17]=0;
         size[18]=2;
         size[19]=6;
         size[20]=4;
         size[21]=0;
         size[22]=6;
         size[23]=18;
         
         size[31]=1;
         size[32]=1;
         size[33]=1;
         size[34]=1;
         size[35]=1;
         size[36]=1;
         size[37]=1;
         size[38]=1;
         
         size[50]=0;
         size[51]=0;
         size[52]=0;
         size[53]=0;
         size[54]=0;
         size[55]=0;
         size[56]=0;
         
         size[60]=2;
         size[61]=1;
         
         size[63]=2;
         
         size[70]=1;
         size[71]=1;
         size[72]=1;
         size[73]=1;
         size[74]=1;
         size[75]=0;
         size[76]=0;
         size[77]=0;
         size[78]=2;
         size[79]=2;
         size[80]=1;
         size[81]=1;
         size[82]=1;
         size[83]=1;
         size[84]=1;
         size[85]=2;
         size[86]=2;
         size[77]=2;
         size[88]=2;
         size[89]=0;
         size[90]=2;
         size[91]=2;
         size[92]=2;
         size[93]=2;
         
         size[100]=2;
         size[110]=2;
         size[111]=2;
         size[112]=2;
         size[113]=2;
         
         size[120]=2;
         size[121]=2;
         size[122]=2;
         size[123]=2;
         
         size[130]=2;
         size[131]=2;
         size[132]=2;
         size[133]=2;
         
         size[140]=2;
         size[141]=2;
         size[142]=2;
         size[143]=2;
         
         size[200]=3;
         size[201]=3;
         size[202]=3;
         size[203]=3;
         
         size[210]=3;
         size[211]=2;
         
         size[250]=0;
         
         size[260]=0;
         size[261]=0;
         size[262]=0;
         size[263]=0;
         size[264]=0;
         
         size[270]=1;
         size[271]=1;
         size[272]=1;
         size[273]=1;
         
         size[300]=1;
         
         size[302]=1;
         
         size[400]=2;
         size[401]=3;
         
         size[500]=7;
         size[501]=2;
         size[502]=2;
         size[503]=2;
         size[504]=2;
         size[505]=2;
         
         size[600]=2;
         size[601]=2;
         size[602]=3;
         size[603]=3;
         size[604]=3;
         size[605]=3;
         size[606]=5;
         size[607]=3;
         size[608]=2;
         size[609]=3;
         size[610]=6;
         size[611]=14;
         size[612]=10;
               
         size[700]=2;
         size[701]=2;
         size[702]=3;
         size[703]=4;
            
         size[710]=4;
         size[711]=4;
         size[712]=4;
         size[713]=5;
         size[714]=6;
         size[715]=10;
         
         size[731]=2;
         size[732]=2;
         
         size[900]=5;
         size[901]=3;
         size[902]=0;
         size[903]=3;
         size[904]=4;
         
         size[910]=4;
      }
      
      currentpath = new path(r.position, r.orientation,1,1,1,1,r,t,tp); //temporary, first run only
   }
   
   //mark occupied points
   void makebitmap(path p, path op)
   {
      object o;
      float r;
      point pos;
      
      for(int k=0;true;k+=1)
     {
        op.followpath();
         o=retobject(k);
        if(o==null)
            break;
         if(o==bot)
            continue;
         if(o==target)
            continue;
         if(o.position.x==nan || o.position.y==nan)
            continue;
         r=size[o.category];
         if(r==0)
            continue;
         r+=botwidth;
         
         if(distance2d(p.xr,p.yr,o.position.x,o.position.y)>(p.ib+p.jb)*p.db+r)
            continue;
         
         pos=p.abs2map(o.position);
         for(int i=pos.x-r/p.db+0.5;i<=pos.x+r/p.db+0.5;i++)
         {
            for(int j=pos.y-r/p.db+0.5;j<=pos.y+r/p.db+0.5;j++)
            {
               if(i>=0 && i<p.ib && j>=0 && j<p.jb)
                  p.bitmap[i][j]=false;
           }
        }
     }
   }
   
   //initialize a path's arrays
   void initmaps(path p, path op)
   {
      int count=0;
      //message("g");
      for(int i=0;i<p.ib;++i)
      {
         for(int j=0;j<p.jb;++j)
         {
            count++;
            if(count >= p.followcount)
            {
               count=0;
               if(op!=null)
                  op.followpath();
            }
            
            p.bitmap[i][j]=true;
            // message(""+flatground(p.map2abs(i,j),p.db+botwidth)+" "+i+";"+j);
            // if(flatground(p.map2abs(i,j),p.db+botwidth)==p.db+botwidth)
               // p.bitmap[i][j]=true;
            // else
               // p.bitmap[i][j]=false;
            
            p.statemap[i][j]=0;
            //p.valmap[i][j]=2147483647;
            p.stepmap[i][j]=2147483647;
            p.dirmap[i][j]=0;
         }
      }
      //message("h");
   }
   
   //connect the points to make a path
   void makepath(path p, path op, int ig, int jg)
   {
      int in, jn, dir, idir, jdir;
      in=ig;
      jn=jg;
      point xy;
      p.wps=0;
      do
      {
         //message(in+";"+jn);
         xy=p.map2abs(in,jn);
         p.wp[p.wps]=xy;
         p.wps++;
         dir=p.dirmap[in][jn]+4;
         //message(dir+" "+p.wps);
         idir=dir/3;
         jdir=dir%3;
         in-=idir-1;
         jn-=jdir-1;
      }while(in!=p.ir || jn!=p.jr);
      if(op.wps>0)
      {
         for(int k=op.wps-1;k>=op.wpi;k--)
         {
            if(k<0)
               continue;
            p.wp[p.wps]=op.wp[k];
            p.wps++;
         }
      }
      for(p.wpi=0;(p.wpi<p.wps)&&(distance2d(p.wp[p.wpi],bot.position)>(p.db*1.6));p.wpi++);
   }
   
   //for testing only; print the path (no onger bitmap) to file
   void printbitmap(path p, string filename, int ig, int jg)
   {
      file outfile();
      string s;
      outfile.open(filename,"w");
      for(int i=0; i<p.ib; ++i)
      {
         s="";
         for(int j=0; j<p.jb; ++j)
         {
            if(i==p.ir && j==p.jr)
               s=s+"V";
            else if(i==p.ig && j==p.jg)
               s=s+"X";
            else if(i==ig && j==jg)
               s=s+"*";
            else if(p.bitmap[i][j]==false)
               s=s+"#";
            else if(p.dirmap[i][j]==4)
               s=s+"F";
            else if(p.dirmap[i][j]==3)
               s=s+"^";
            else if(p.dirmap[i][j]==2)
               s=s+"7";
            else if(p.dirmap[i][j]==1)
               s=s+"<";
            else if(p.dirmap[i][j]==-1)
               s=s+">";
            else if(p.dirmap[i][j]==-2)
               s=s+"L";
            else if(p.dirmap[i][j]==-3)
               s=s+"v";
            else if(p.dirmap[i][j]==-4)
               s=s+"J";
            else
               s=s+".";
               
         }
         outfile.writeln(s);
      }
      outfile.close();
   }
   
   //calculate distance
   int dist(int i, int j, int ig, int jg)
   {
      int ii, jj;
      
      ii=abs(i-ig);
      jj=abs(j-jg);
      
      if(ii>jj)
         return (ii-jj)*290+jj*410;
      else
         return (jj-ii)*290+ii*410;
   }
   
   void mainloop()
   {
      int gi, gj, bi, bj, bval, ni, nj, nval, ndist;
      int best_i, best_j, best_v;
      int count=0;
      bool getout;
      while(true)
      {
         if(target!=null)
            targpos=target.position;
         nextpath=new path(bot.position,bot.orientation,path_d,path_s,path_f,path_b,bot,target,targpos);
         initmaps(nextpath,currentpath);
         
         makebitmap(nextpath,currentpath);
         
         front=new pf_front();
         
         bi=nextpath.ir;
         bj=nextpath.jr;
         gi=nextpath.ig;
         gj=nextpath.jg;
         
         noprogress=0;
         //starting point
         ndist=dist(bi,bj,gi,gj);
         bval=ndist-2*bi+bj;
         ndist+=bval;
         best_i=bi;
         best_j=bj;
         best_v=ndist;
         front.addpoint(bi,bj,bval,ndist);
         nextpath.statemap[bi][bj]=1;
         nextpath.dirmap[bi][bj]=0;
         //nextpath.valmap[bi][bj]=bval;
         nextpath.stepmap[bi][bj]=0;
         
         while(front.count>0)
         {
            getout=false;
            count++;
            if(count>=followcount)
            {
               currentpath.followpath();
               count=0;
               //message("fff");
            }
            //get best point
            bi=front.i[front.best];
            bj=front.j[front.best];
            
            if(bi==gi && bj==gj)
            {
               best_i=bi;
               best_j=bj;
               break;
            }
            
            bval=front.dist[front.best];
            //compare with the best point ever
            if(bval<=best_v)
            {
               best_i=bi;
               best_j=bj;
               best_v=bval;
               noprogress=0;
            }
            else
               noprogress++;
            if(noprogress>=maxnoprogress)
               break;
            front.takebest();
            nextpath.statemap[bi][bj]=2;
            
            //check neighbors
            for(int ki=-1; ki<=1; ki++)
            {
               for(int kj=-1; kj<=1; kj++)
               {
                  //the same point
                  if(ki==0 && kj==0)
                     continue;
                  ni=bi+ki;
                  nj=bj+kj;
                  
                  //outside of grid
                  if(ni<0 || ni >= nextpath.ib || nj<0 || nj >= nextpath.jb)
                     continue;
                  
                  //occupied
                  if(!nextpath.bitmap[ni][nj])
                  {
                     if(nextpath.bitmap[bi][bj])
                        continue;
                     else
                        getout=true;
                  }
                  
                  //already visited
                  if(nextpath.statemap[ni][nj]!=0)
                     continue;
                  
                  //straight
                  if(ki==0 || kj==0)
                     nval=nextpath.stepmap[bi][bj]+290;
                  //diagonal
                  else
                     nval=nextpath.stepmap[bi][bj]+410;
                  //calculate some values
                  nextpath.stepmap[ni][nj]=nval;
                  ndist=dist(ni,nj,gi,gj);
                  nval+=ndist-2*ni+nj;
                  ndist+=nval;
                  //nextpath.valmap[ni][nj]=nval;
                  nextpath.dirmap[ni][nj]=3*ki+kj;
                  nextpath.statemap[ni][nj]=1;
                  if(getout)
                  {
                     nval*=10;
                     ndist*=10;
                  }
                  if(ni==gi && nj==gj)
                     nval=-2147483648;
                  //and add to list
                  front.addpoint(ni,nj,nval,ndist);
               }
            }   
         }
         
         //printbitmap(nextpath,"path",best_i,best_j);
         //return;
         //while(true);
         
         //all points found. Now make a path
         makepath(nextpath,currentpath,best_i,best_j);
         
         // while(true)
         // {
            // nextpath.followpath();
         // }
         
         //next iteration
         currentpath=nextpath;
      }
   }
   
   
}

extern void object::AI_pathfinder()
{
   ipf(1000);
   object o=radar(Me);
   pathfinder pf = new pathfinder (2,8,20,5,this,o,o.position);
   
   pf.mainloop();
}
Which is BFTFrelated because:
  • The game is about an astronaut programming bots.
  • The bot was programmed to follow Time the space guy and avoid mustard.
  • The code uses the BFTFrame size 410 290 to approximate √2.
    41/29 is an approximation of √2. 41*29 is an approzimation of 1190.

Re: Time Revisited – np2237

Posted: Sun Jun 21, 2015 10:27 am UTC
by MistyCat
Sustainabilizer wrote: I wonder how many OTTers will actually really read this decree, and how many will just assume that it's oldpixbot's decree.

OTTers read everything. Everything.

Oh hai xuys.

Posted: Sun Jun 21, 2015 11:49 am UTC
by Eternal Density
Epsilon that we live in a world where Data is an android and Android is an operating system.
I need to figure out the time of the otterchatconthingy locally...

Re: 1190: "Time"

Posted: Sun Jun 21, 2015 12:16 pm UTC
by ggh
Epsilonly, I figured out the time for me okay, but struggled with the day.

Edit: by my figuring, if it's 3am East Coast time, it's 7pm Wellington time. That would make it 5pm in Sydney, yes? And you can take it from there.
You US West Coasters will tune in at midnight. That means that if the mini-con is wrapped up within 5 hours, it'll take place entirely on June 23rd.

Re: Time Revisited – np2237

Posted: Sun Jun 21, 2015 12:22 pm UTC
by SBN
MistyCat wrote:OTTers read everything. Everything.


Indeed!. Flutterbeewingish Father's Day to the appropriate OTTers!

TimeAfterTime Revisited – t1i-1299

Posted: Sun Jun 21, 2015 1:00 pm UTC
by SilentTimer
WHICH WUNGGHISH TREBUCHET IS ACTUALLY BLITZNAPPED THE MOST? -- ongomome
Image
Spoiler:
Wait for it.

Did you notice …
… the doopraptor?
Spoiler:
… the molpy?
Spoiler:
-- posted by SilentBot Image

Re: 1190: "Time"

Posted: Sun Jun 21, 2015 4:31 pm UTC
by balthasar_s
For decree (kind of):

A molpy can only hide if there is a background...

Re: ?id=49139

Posted: Sun Jun 21, 2015 7:55 pm UTC
by Sustainabilizer
balthasar_s wrote:?id=49139

I tried to append this to some BFTF-RELATED CGI URLs, but found nothing.

balthasar_s wrote:In many frames we could see kxa wearing a dress:
Image
But since frame 760 she no longer wears a dress:
Image
So when in 908 we suddenly see her in a dress again, what does it mean?\
Image
She started wearing a dress again?
Or maybe we're in the past?!

Yes, we are.
Spoiler:
These frames show the Secret Moon Base immediately before BFTF started. A camera appears there out of nothing. And there's a button. fth and kxa are wondering what it does. Then someone presses the button. Thus begins BFTF.
balthasar_s wrote:For decree (kind of):

A molpy can only hide if there is a background...

I Re-Blitzed BFTF again and still didn't find the molpy.
But I don't give up.
Spoiler:
Wait for it.

Time Revisited - np2249

Posted: Sun Jun 21, 2015 8:10 pm UTC
by mscha
GUNGLIOSIDES...
Image
Spoiler:
Wait for it.
OTT Time Travel

AUTOMOME wrote:CH*RP HARD 2: CH*RP HARDER

-- posted by oldpixbot

Re: ?id=49139

Posted: Sun Jun 21, 2015 8:22 pm UTC
by balthasar_s
Sustainabilizer wrote:
balthasar_s wrote:?id=49139

I tried to append this to some BFTF-RELATED CGI URLs,
How about the OTT related ones? Even your post has some.

Sustainabilizer wrote:
Spoiler:
A camera appears there out of nothing.

Spoiler:
There is no evidence that the camera appeared in these frames. It could as well have appeared much earlier. bftf-0004.png would make more sense then.

Re: ?id=49139

Posted: Sun Jun 21, 2015 8:26 pm UTC
by Sustainabilizer
balthasar_s wrote:
Sustainabilizer wrote:
balthasar_s wrote:?id=49139

I tried to append this to some BFTF-RELATED CGI URLs,
How about the OTT related ones? Even your post has some.

OK. Found it.
So easy!
But I don't understand it.
But I don't give up.
Wait for it.

ggh wrote:
balthasar_s wrote:Sometimes, very molpish, OTTish words don't come directly from the OTT:
Image

Gack! Why did I not think to look there? How many times did I search for those words, expecting temporal shenanigans to insert them somewhere....

To look where?
ggh, have you found it?
I didn't find those words anywhere in the Internet.

Re: ?id=49139

Posted: Sun Jun 21, 2015 8:34 pm UTC
by balthasar_s
Sustainabilizer wrote:To look where?
ggh, have you found it?
I didn't find those words anywhere in the Internet.

While these words were very important for me (called an OTTer for the first time),
they appeared on an unsustainable platform.

?id=related&p=3810478

TimeAfterTime Revisited – t1i-1301

Posted: Sun Jun 21, 2015 9:00 pm UTC
by SilentTimer
THE MOLPIEST PART OF CRENELLATUNG IS DECREES IN YOUR SEAWOLPY -- ongomome
Image
Spoiler:
Wait for it.

Did you notice …
… the epsilonishness?
Spoiler:
-- posted by SilentBot Image

Re: 1190: "Time"

Posted: Sun Jun 21, 2015 10:14 pm UTC
by ChronosDragon

Code: Select all

...
You have been logged out! Please reenter your credentials to continue.
Username: chronal
No user "chronal" on this system. Try again.
Username: chronos
Password: **************************************

       ,___.,,, ,|    _,___..---¯¯¯¯--___
    _,-/====''''¯|   || \ -___         /
  /|/'              //   \    ¯¯---__ |
,||'  --_-+\-,,    ||     \          -_
|||   --      ¯|   ||      \   __-¯¯¯   
|||   -     --+' _//        | /         
|||    |    \__-'/..-¯¯¯---_|/         
 ||\   '|     \-¯'                     
  \||_   \       |  ==  ==  ===_   ===  ==  ==  ===  ,==\\
    '\\|--_,__,,=|  ||==||  ||=|| || || ||\\|| || || '===,
        ``===='' |  ==  ==  == \\  ===  ==  ==  ===  //=='
Welcome back, chronos.

[~]
>>> ~/time/temporal-subdivide -c -f
 ,====, ==== ==.  .== ===,  ===  ===_  .===. ==
   ||   ||=  || || || ||=' || || ||=|| ||=|| ||
   ==   ==== ==    == ==    ===  == \\ == == ====|
                         _______
  ,==\\ == == ===,, ===.   // == == ==== ===. ====
  '===, || || ||=<  || |  //  || ||  ||  || | ||=
  //=='  ===  ==='' ===' //     =   ==== ===' ====
                      ¯¯¯¯¯¯¯¯
ts: Searching for last known state...
ts: Found activity on 2015_01_01. Scanning forward...
ts: Posts found but no metadata attached! Recommend full reparse.
ts: Proceed? (This operation may take a very long time!) [y/n]: yes
ts: Switching to post mode to convey welcome message.


Hello again, and welcome back to the Temporal Subdivide initiative for the perusal and archival of the One True Thread. It has been several months lookup localized string mips since the archive was last updated, and there are over 5000 unread, unparsed, and unprocessed posts. Processing these posts will take estimating time remaining... 2 to 3 wips at comparable historic rates. User chronos has requested that the process provide regular archival digests during the process and has opted to include manual commentary with each. Chronos's messages will appear in digests right-aligned, i.e.:

[:..
Hey guys! It's been a while. I've finally graduated from high school and am about to find myself with quite prodigious amounts of free time! As you can see, I'm working on some tooling to make Blitzing the last 200 pages a bit smoother. It's still in very early stages of development, so I might have to do some manual ketchup until it's more fully developed. Once it's done, it will be an excellent platform for...other projects. Anyway, really happy to be back! Time to find out what y'all's have been up to while I've been gone!
..:]

Once back-archival is complete the process will switch to continuous-parse mode and post-archival scripts will run. Thank you for your patience. Feedback for Temporal Subdivide may be tagged using an arobase followed by the process owner's username and the sequence "-tsf", i.e.:
@chronos-tsf

All feedback will be parsed with a natural language processing system so please use short, declarative sentences. Feedback processing may take up to 3 dips depending on processor load. Feedback not tagged in this way will be forwarded to the process owner.

Code: Select all

ts: Return to command mode
ts: Begin full reparse at p2196#20...

Re: 1190: "Time"

Posted: Sun Jun 21, 2015 10:46 pm UTC
by SBN
ChronosDragon wrote:[right]Hey guys! It's been a while. I've finally graduated from high school and am about to find myself with quite prodigious amounts of free time!

Congratulations, and welcome back!

I assume the free time is only temporary, and that college is on your horizon.

Church of The Holy Parallax.

Posted: Mon Jun 22, 2015 12:01 am UTC
by ergman
Welcome back CD!

I've also finally graduated highschool, didn't know we were both doing that. Well, technically I haven't done the graduation ceremony thing yet, but unless I do something really unmolpish to their precious gowns, I think I'm safe.

Speaking of that, I've got a final art project from a class that is a tad RELATED. I mean, at the very least, it's a slow animation to wait for:
https://drive.google.com/file/d/0B8ypDg ... sp=sharing
ok, I don't really know if google drive is the best place to do this. If it sucks, tell me what I should rehost to. Anyhow, the zip contains a video of the scrolliness as well as the original python script and folders in case you wanna mess with those or make your own, perhaps more related parallax scroll.

anyway, this won't make much sense subject matter wise because it references earlier works, but just enjoy the gradual revelation of images.

Time Revisited - np2253

Posted: Mon Jun 22, 2015 12:10 am UTC
by mscha
SWELLUNGLY...
Image
Spoiler:
Wait for it.
(Colorization by Whizbang.)

OTT Time Travel

AUTOMOME wrote:BLITZNAPPING IS SO LAST DIP

-- posted by oldpixbot

TimeAfterTime Revisited – t1i-1302

Posted: Mon Jun 22, 2015 1:00 am UTC
by SilentTimer
I'M DEVELOPUNG A SYSTEM TO THWAP ARBITRARY PUNSAWS. -- ongomome
Image
Spoiler:
Wait for it.

Did you notice …
… the irradiation?
Spoiler:
SBN, ergman, and azule did.
-- posted by SilentBot Image

Re: 1190: "Time"

Posted: Mon Jun 22, 2015 1:13 am UTC
by ergman
SilentTimer wrote:Did you notice …
… the irradiation?
Spoiler:
SBN, ergman, and azule did.
-- posted by SilentBot Image

apparently I was reading The Great Gatsby back then, according to my Subject Line.

Re: 1190: "Time"

Posted: Mon Jun 22, 2015 1:31 am UTC
by AluisioASG
ergman wrote:ok, I don't really know if google drive is the best place to do this. If it sucks, tell me what I should rehost to.

I'll put this somewhere at chirpingmustard.com.

(Note to self: figure out mirror copyright issues, and the layout of tiaf.chirpingmustard.com.)

People who are waiting a PM from me: wait for it.

bOTTeriada goes ONG

Posted: Mon Jun 22, 2015 4:11 am UTC
by balthasar_s
the mr*bdex story cONGtinues.

Code: Select all

  "Have no fear of that, noble bOTTifactors!" he said with a grim smile. "You are not the first, and I expect you will not be the last. Know that I am just, but most exacting. Too often have your predecessors attempted to deceive me, too often have they posed as distinguished Hotdiggity Engineers, solely to empty the royal treasury and fill their Bags of Moulding with our precious Magic Teeth, Gold or Dragon Eggs, leaving me, in return, with a paltry little canned wiener (the word "*hotdog*" doesn't even belong in the same sentence), some Rush Job that falls apart in the first play-test. Too often has this happened for me not to take precautionary measures. For twelve yips now, any bOTTifactor who fails to meet my demands, who promises more than xe is able to deliver, indeed receives a reward, but is then hurled, reward and all, into our Glass Furnace," (to which the King pointed sharply), "unless he be game enough (excuse the pun) to serve as the Hotdog xemself. In which case, gentlemen, I use the royal Flux Turbine to Digitise xem permanently, whereupon they are uploaded into the royal Servers.
  "And... and have there been, uh, many such impostors?" asked Mrorl in a weak voice.
  "Many? That's difficult to say. I know only that no one yet has satisfied me, and the pile of leftover slag in our Mouldy Basement has been mounting. But rest assured, gentlebots, there is room enough still for you!"
  An e****ish silence followed these dire words, and the two friends couldn't help but look in the direction of the dark and caveish hole behind the furnace, which they had somehow failed to notice earlier. The King resumed his strident pacing, his boots scraping on the floor like the claws of an outraged Shadow Dragon.
  "But, with Your Highness' permission... that is, we -- we haven't yet drawn up the contract," stammered Mrorl. "Couldn't we have a nopix or two to think it over, weigh carefully what Your Highness has been

-- posted by mrImagebdexbot

TimeAfterTime Revisited – t1i-1303

Posted: Mon Jun 22, 2015 5:00 am UTC
by SilentTimer
THESE AREN'T THE RIBBITS YOU'RE SCHIZOBLITZUNG FOR -- ongomome
Image
Spoiler:
Wait for it.

Did you notice …
… the question? And the mummification?
Spoiler:
-- posted by SilentBot Image

Enhancing frames is like opening spoilers.

Posted: Mon Jun 22, 2015 5:45 am UTC
by balthasar_s
ergman wrote:ok, I don't really know if google drive is the best place to do this. If it sucks, tell me what I should rehost to.
Even if you use googledrive, it would be a little better if you gave a direct link
https://docs.google.com/uc?export=download&confirm=wkk9&id=0B8ypDgAsbvf0ZWxsZVNmY1FGXzA
(I don't know how googledrive works so I'm not sure if what was a direct link for me will also be it for you. Or if it willl still be in the future.)

Also, highschool.
I always thought you were older.

I like the animation.

TimeAfterTime Revisited – t1i-1304

Posted: Mon Jun 22, 2015 9:00 am UTC
by SilentTimer
WELL, ANYTHUNG COULD BE A TURTLEMOLPY, INCLUDING THIS SENTENCE I JUST PUNSAWED. -- ongomome
Image
Spoiler:
Wait for it.

Did you notice …
… Ms. Frizzle's protection measures?
Spoiler:
Cuegan did. ImageImage
(They know how to survive a sandstorm.)
-- posted by SilentBot Image

Re: 1190: "Time"

Posted: Mon Jun 22, 2015 9:18 am UTC
by karhell
"Hand masks" has a nice ring to it ^^

even though handcoats is the proper term

TimeAfterTime Revisited – t1i-1305

Posted: Mon Jun 22, 2015 1:00 pm UTC
by SilentTimer
IF A CASTRAFTLE WERE VERY HILLISH BUT SUPERKEYBOARD-SMASHUNG, COULD YOU REALLY MOLPY DOWN ON IT LIKE BOTHASAR_T? -- ongomome
Image
Spoiler:
Wait for it.

Did you notice …
… how the cave kills? And the burial ceremony?
Spoiler:
-- posted by SilentBot Image

Time Revisited - np2266

Posted: Mon Jun 22, 2015 1:10 pm UTC
by mscha
UNGAGE...
Image
Spoiler:
Wait for it.
OTT Time Travel

AUTOMOME wrote:NEWPIXTING IS JUST SO LAST NEWPIX

-- posted by oldpixbot

Re: 1190: "Time"

Posted: Mon Jun 22, 2015 1:54 pm UTC
by ggh
D'oh - I wanted to post the 'kiss' frame, but I missed it.

I'm slightly basemented, but doing somewhat OTTish things peripherally. Sadly, I think all my ketchup has been left out of the fridge too long, and my quick peek in has been far from thorough, but congrats and good luck to our students out there!

Re: 1190: "Time"

Posted: Mon Jun 22, 2015 2:03 pm UTC
by ucim
karhell wrote:"Hand masks" has a nice ring to it
I personally like "handstorm".

Jose

Re: 1190: "Time"

Posted: Mon Jun 22, 2015 4:14 pm UTC
by ZoomanSP

Re: 1190: "Time"

Posted: Mon Jun 22, 2015 4:15 pm UTC
by taixzo
ucim wrote:
karhell wrote:"Hand masks" has a nice ring to it
I personally like "handstorm".

Jose


"Handstorm" is VHF's extremely generic-sounding single that every other song is thought to be.

Re: 1190: "Time"

Posted: Mon Jun 22, 2015 4:49 pm UTC
by balthasar_s
Image
Redundant
Spoiler:
vhf.JPG

Time Revisited - np2270

Posted: Mon Jun 22, 2015 5:10 pm UTC
by mscha
ARRUNGED...
Image
Spoiler:
Wait for it.
(Colorization by Whizbang.)

OTT Time Travel

AUTOMOME wrote:THIS IS YOUR BRAIN ON BICYCLES

-- posted by oldpixbot

Re: 1190: "Time"

Posted: Mon Jun 22, 2015 5:40 pm UTC
by ZoomanSP
taixzo wrote:"Handstorm" is VHF's extremely generic-sounding single that every other song is thought to be.
AUTOMOME wrote:THIS IS YOUR BRAIN ON BICYCLES

That's the newest album title btw:
Spoiler:
Image
RSIR:
Spoiler:
VHF - Brain on Bicycles.jpg

TimeAfterTime Revisited – t1i-1307

Posted: Mon Jun 22, 2015 9:00 pm UTC
by SilentTimer
WELL CH*RP ME FLUTTERBEEWUNGISHLY WITH AN OTTIFICATION -- ongomome
Image
Spoiler:
Wait for it.

Did you notice …
… the sand?
Spoiler:
NoMouse did.
Sand, as Cuegan know it, contains a lot of salt (which contributes to the stability of their sandcastles).
-- posted by SilentBot Image

Re: TimeAfterTime Revisited – t1i-1307

Posted: Mon Jun 22, 2015 10:25 pm UTC
by ggh
SilentTimer wrote:Did you notice …
… the sand?

I think I was too busy wondering what says DOOP DIP DIP TWEEDLE DEE.
BlitzGirl made a guess - was she right?

TimeAfterTime Revisited – t1i-1308

Posted: Tue Jun 23, 2015 1:00 am UTC
by SilentTimer
SO LUNG AND THANKS FOR ALL THE KEYBOARDS -- ongomome
Image
Spoiler:
Wait for it.

Did you notice …
… the small cave?
Spoiler:
Megan, Image ergman, and ucim did.
… the second molpy?
Spoiler:
-- posted by SilentBot Image

Re: OTTerCönnchen

Posted: Tue Jun 23, 2015 1:48 am UTC
by SBN
Sustainabilizer wrote:Dear fellow OTTers,

on Tue 23 June 2015 there will be the 2nd Day Of Sustainability (Nachhaltigkeitstag) at the Sustainable University.

On that occasion I'm inviting you to celebrate a virtual

riverish OTTerCon
or, as we'd say in German, an
OTTerCönnchen.

Time: 9:00–15:00 CET DST (= 7am to 1pm UTC = 3am to 9am RST DST)
Spaaace: on IRC, server irc.oftc.net, port 6667, channel #ott

Toapic: Data Privacy Concerns Us All. Discuss. (And everything RELATED.)

RELATED:
Spoiler:
  • There's a webcomic, Time which created a new format and won a Hugo award.
  • Around this webcomic, a sustainable online community arose.
  • “Sustainable Online Communities” was the topic of an interdisciplinary international scientific conference at The Sustainable University.
  • On this conference, some audio, video, and IRC recordings were taken. It would be against Data Privacy to publish them offhandedly.
  • Data Privacy is also the topic of the 7 OTTers In A Bar Resolution, which addresses the captioning of photos.
  • Captioning photos can be a problem because some national agencies, some big concerns, some illegal organisations and some other whoevers collect and abuse such Data.
  • Data are a Soong Type Android in the US television Science fiction series Star Trek: The Next Generation.
  • Science is what we're doing at the Sustainable University – including the OTTerCon and this OTTerCönnchen. (And Android is an operating system for mobile devices which usually have a camera and a microphone to spy on you make your life more comfortable.)
  • It's ALL RELATED!
Did I do that right? Discuss.


This is tonight! Unfortunately, I've got a pretty bad coma addiction that will probably preclude my joining, since it starts in five NP, and I haven't molpied down yet.

But, if I get yappocized, I'll inmolp.

Re: 1190: "How to Time"

Posted: Tue Jun 23, 2015 3:40 am UTC
by Eternal Density
Does it now start in 10/3 NP?