Posts for Bisqwit


Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Tennis seems very easy in my opinion.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Kitsune wrote:
I'm just hoping that more people decide to seed this 3 Files torrent. At the current moment it's going to take me three days to download it all. xD
Yeah, I cannot seed at a very fast rate. Sorry about that.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Kitsune wrote:
I was just wondering if someone could please seed the Three Files torrent for me. :3 But really, either torrent would do. Edit: Well, since the 3 Files torrent is the one downloading now, that would be the prefered one for everyone to seed. :3 Thanks to those of you that have started to seed. ;3
I forced all three torrents to my seeding list when you first posted, before your first edit...
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
nooodl wrote:
I looked at the Tricks page for Super Mario Bros. 1 and realized there's a glitch very briefly mentioned, but actually useful. There's no animated gif for it yet, but I think there should be one
Actually, it is just a header serving as an introduction to a couple of different enter-the-wall techniques -- each of which _do_ have an animation.
Post subject: Re: I need some help with a programming assignment
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Schnretzl wrote:
Bisqwit wrote:
You cannot indulge us in your lack of motivation to participate on the lessons.
Perhaps I made an overstatement. It's not that I have a lack of motivation to learn about pthreads, but more that I don't understand them too well or have much experience with them.
What I mean is that if they present you with that kind of assignment, they must have already taught you the concepts necessary to complete the assignments. If that is not true, one of these holds: -- They did not teach. Bad school. -- They taught but you did not listen. Not our problem. -- They taught, but you fail to understand how to apply the lessons. In that case, you should present us with your attempt and explain what it is precisely that you have trouble figuring out. The core question here is: How do they expect you to be able to solve the assignment?
Post subject: Re: This might be pretty annoying, but...
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
nooodl wrote:
is this one of those forums where you just start posting as if you were always here?
Indeed it is. Also, the next time you post, please try to think of a subject for your post that actually describes the subject. As in, what it is that you are posting about. In this case, a fitting subject would have been "is there an introduction topic somewhere here?" for example. So that when one browses the list of topics on the forum, each topic indicates what kind of content is there in, so people can know where to post about different things. If you make subjects like "a question" or "this is sudden, but", for example, nobody can know what kind of dilemma is discussed within without having to read the actual discussion there. Since people aren't exactly willing to wade through hundreds of arbitrarily named topics to find what they want, we recommend people to use the Subject field as it is supposed to. That said, welcome.
Post subject: Re: I need some help with a programming assignment
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Schnretzl wrote:
I also know pretty much nothing about pthreads.
And they give you that kind of assignment? You cannot indulge us in your lack of motivation to participate on the lessons.
Post subject: Re: Dehacked's website, down?
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Tuppenfall wrote:
I have been trying connect into DeHackEd's website, but my browser always says that "Website cannot be found" or something similiar. I would have been love to download THIS, but I can't do it. Is it that, the site is completely down? I can't acces into the microstorage either.. :(
Thread merged. Now please learn to use SEARCH.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Guybrush wrote:
qFox wrote:
I don't see the problem with youtube though.
Then you must be blind. TASes on Youtube, people always post negative comments.
Comments can be disabled. Video can be described and prefixed with explanations. I think this would be useful. In the case of published movies, a referral can be made to the location of the high-quality video. Problems are technical. I don't know if Youtube has any API for automatically uploading movies there.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
DaTeL237 wrote:
If you could choose a person to meet in real life, who would it be and why? a) someone tat is currently alive b) anybody that ever existed c) anybody that ever existed, but not from a holy book
a) SCENE: Bisqwit meets ____. _____: Hi, how are you doing. Bisqwit: ... Hi, fine I guess. Bisqwit: ... There isn't particularly anyone. As for any famous person, I don't think I'd be even on a level to talk with them. Well, as for the Messiah, sure I would like to meet him now, but I can wait. It's not like I'll miss my chance. b) Well, if language barrier was not a problem, it would be John the apostle. But again, I can wait. It's not like time is going to be an issue. c) See a). Well, if I twist the meaning of "ever existed" slightly, that person would be my future wife. Also, there are many people from #nesvideos whom I would possibly like to meet some day and talk with. Xkeeper, for instance. But then again, it could just result in the dialog shown in a). Either way.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Ramzi wrote:
Hey Bisqwit where do you see programming languages going in the upcoming decades. Do you think they should become better or worse? Why don't you design your own programming language, that's like, better than the current ones. And, you know, not worse then them?
New (and old) concepts keep coming up, and new programming languages are always made. It's hard to tell which ones become popular and which one do not. Part of it depends on marketing. There are enough programming languages in the world already, and I cannot honestly think any way of inventing a new programming language that wouldn't be just a rehashing of some other programming language.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
pirate_sephiroth wrote:
Bisqwit... disegard the brazilian subtitles... Do you think your future will be the same of the guy at the end of this video? http://www.youtube.com/watch?v=_UXkwGiGpsI
That depends -- whether I get to live until that happens, and whether I am "awake" when it happens (Matt 25:1-13) -- but I of course hope so.
Post subject: Re: Hook, line, and sinker.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
jimsfriend wrote:
I'm intentionally manipulating God's revelation to us in order to promote an atheist agenda, and use Bible to convince Bisqwit that his God is not so loving after all?
That's about the impression I'm getting :) The Devil also uses the Bible... twisting its meaning, still using the very words written in the text. Sometimes only a person who lives spiritually close to God, following his will, can figure out what's amiss with the claims. I'm obviously referring here to the situation where the Messiah was being tempted by Satan. I'm not that blessed yet -- that's why I say that my life is undergoing a change -- but I try to answer what I can. In case of your post addressed to me, an insight of how to reply, or a will to check out all the passages you referred to, has not struck me. I will therefore satisfy with merely this post. Forgive me. Note: This is not to say that you are Devil. You might be influenced by him, though. Most people are. Me, too.
Post subject: Re: I'll bite.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Neophos wrote:
Thelogy. The understanding of gods... Isn't it quite arrogant to claim to have a greater understanding of a supreme being then another just-as-lowly person?
Is it arrogant to claim to have a greater understanding of electromagnetism than another person? Is it arrogant to claim to have a greater understanding of food preparation than another person? Is it arrogant to claim to understand your friend better than someone else does? It's not like these discussions are to push us to some high pedestal. It is to share understanding of what a wonderful God we have.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Neophos wrote:
Does God use his "divine power" to make sure that our actions contribute to whatever his plans are on the whole, or does he, to put it simply, predict everything we do perfectly? Essentially, do we just live in an illusion of free will, but God will make damn sure that you follow his plan he spent probably all of one godly second to make, or is he just winging it with style?
That question falls to the "impossible to know" category.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Boco wrote:
I would like you (and the author of this apologist site you quoted) to reread Romans especially 11-14 because seriously.
Oh, "because seriously". That changes everything.
Post subject: Re: AVI Recording in realtime?
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Tuppenfall wrote:
Does it always lag, or is it possible to encode mupen64 movies in real time (i mean that the game plays in 100%+ speed)? Mine always lags... :(
It depends on the display card speed. AVI recording in mupen64 must be done by reading the rendered screen. In general, reads from the rendered screen are slow ― very slow ― on display card hardware. The larger your screen, the slower it is. The codec speed is another limiting factor (and the harddrive speed), but the display card is usually the bottleneck. It has nothing to do with Mupen64 as such. When we make AVIs of Mupen64 videos, those are done by first recording the playing session into a .m64 file, which records the input actions, and then playing-back the m64 file in AVI recording mode; that recording does not need to happen in real time. In fact, it can even be slower than 1 fps, and yet, the resulting AVI plays fluently at full speed. It just takes very long to record the AVI for even a short movie.
Tuppenfall wrote:
Someone plez answer!
That kind of comment is unnecessary. It does not influence people, and it distracts from the content.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Warp wrote:
Can give an estimate of how much bandwidth this technique saves in your image server?
Likely it saves a negative amount currently, because our individual screenshots are quite optimized usually :)
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
I cleaned up the code a bit.
#include <algorithm> // for std::swap
#include <vector> // for size_t

template<typename IntType>
class LeoNum
{
public:
    LeoNum():                      cur(1), prev(1) { }
    LeoNum(IntType c, IntType p) : cur(c), prev(p) { }

    void go_up()   { *this = LeoNum<IntType>(cur+prev+1, cur); }
    void go_down() { *this = LeoNum<IntType>(prev, cur-prev-1); }
    
    IntType value() const     { return cur; }
    IntType prevvalue() const { return prev; }
    IntType get_gap() const   { return value() - prevvalue(); }

private:
    IntType cur, prev;
};

namespace
{
    template<typename PtrT, typename IntType>
    void sift(PtrT array, IntType root, LeoNum<IntType> b)
    {
        // Sifts up the root of the stretch in question. 
        
        IntType root2;
        while(b.value() >= 3)
        {
            if(array[root - b.get_gap()] >= array[root - 1])
                root2 = root - b.get_gap();
            else
                { root2 = root-1; b.go_down(); }
            
            if(array[root] >= array[root2]) break;
            std::swap(array[root], array[root2]);
            root=root2;
            b.go_down();
        }
    }

    template<typename PtrT, typename IntType, typename Ptype>
    void trinkle_if_adjacent_stretches_are_trusty(PtrT array, IntType root, Ptype p, LeoNum<IntType> b)
    {
        if(array[root - b.prevvalue()] >= array[root])
        {
            std::swap(array[root], array[root - b.prevvalue()]);
            trinkle(array, root - b.prevvalue(), p, b);
        }
    }

    template<typename PtrT, typename IntType, typename Ptype>
    void trinkle(PtrT array, IntType root, Ptype p, LeoNum<IntType> b)
    {
        // Trinkles the roots of the stretches of a given array and root. 
        // p describes a "standard concatenation's codification
        while(p != 0)
        {
            while(p % 2 == 0) { p >>= 1; b.go_up(); } // p bitmask is xxxxx0
            --p;
            if(!p || array[root] >= array[root - b.value()]) break;
            if(b.value() == 1)
                { std::swap(array[root], array[root - b.value()]); root -= b.value(); }
            else if(b.value() >= 3)
            {
                IntType root2 = root - b.get_gap(), root3 = root - b.value();
                if(array[root-1] >= array[root2])
                    { root2 = root-1; p <<= 1; b.go_down(); }
                if(array[root3] >= array[root2])
                    { std::swap(array[root], array[root3]); root = root3; }
                else
                    { std::swap(array[root], array[root2]); root = root2; b.go_down(); break; }
            }
        }
        sift(array, root, b);
    }
}

template<typename PtrT, typename IntType, typename Ptype>
void smoothsort(PtrT array, IntType count)
{
    if(!array || !count) return;
    
    Ptype p = 1;
    LeoNum<IntType> b(1,1);
    
    // p describes a "standard concatenation's codification
    
    for(IntType q=0; ++q < count; ++p)
        if(p % 8 == 3) // p bitmask is xxxx011
        {
            sift(array, q-1, b);
            b.go_up();
            b.go_up();
            p >>= 2;
        }
        else if(p % 4 == 1) // p bitmask is xxxxx01
        {
            if(q + b.prevvalue() < count)
                sift(array, q-1, b);
            else
                trinkle(array, q-1, p, b);
            
            for(;;)
            {
                p <<= 1;
                b.go_down();
                if(b.value() <= 1) break;
            }
        }
    trinkle(array, count-1, p, b);
    
    while(count > 1)
    {
        --p; --count;
        
        if(b.value() == 1)
            while(p % 2 == 0) { p >>= 1; b.go_up(); } // p bitmask is xxxxx0
        else if(b.value() >= 3)
        {
            if(p != 0)
                trinkle_if_adjacent_stretches_are_trusty(array, count - b.get_gap(), p, b);
            
            b.go_down(); p <<= 1; ++p;
            trinkle_if_adjacent_stretches_are_trusty(array, count-1, p, b);
            b.go_down(); p <<= 1; ++p;
        }
    }
}

template<typename RandomIterator>
void smoothsort(RandomIterator begin, RandomIterator end)
{
    typedef size_t ptrdiff_t ;
    
    smoothsort<RandomIterator, ptrdiff_t, unsigned long long>
        (begin, ptrdiff_t(end-begin));
}
Still compiles and works, has less obnoxious operator overloads and less _ characters. And is shorter and therefore less demanding on human memory, and thus easier to understand. Though its working still defies me. I can't even find the word "trinkle" in a dictionary.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
OmnipotentEntity wrote:
The code you quoted is pretty obfuscated despite the airy and well-commented appearance.
Eh, I can read the code and I understand what each lines does, the code in the paper you linked is just as bad, probably worse.
Well, sure, I can too, but that doesn't mean I understand its intent any more than you do. That's what I refer to by obfuscated. For example, I can tell just fine what each statement in this code (by Peter Klausler, from IOCCC 2005) does:
typedef unsigned char B;
char *x[] = {
#include "dict.h"
  0
};

typedef struct L
{
  B *s;
  struct L *n;
} L;
L *h[128], *l[128], *s[128], Z[sizeof x / sizeof *x], *F = Z;
int c[256], m, a = 1;
int k (B * q)  
{
  int g = 0;
  B *p = q;
  while (*p)
    g |= !c[*p++]--;
  return g - 1 & p - q;
}

void u (B * p)
{
  while (*p)
    c[*p++]++;
}

void S (int N, int r, int t, L * W)
{
  L *w;
  int i, n;
  for (n = r < N ? r : N; n > 0; n--)
    for (w = n == N ? W : h[n];
         s[t] = w;
         u (w->s), w = w->n)
      if (k (w->s))
    if (n == r)
      {
        if (t == m - 1)
          for (i = a = 0; i <= t; i++)
        printf ("%s%c", s[i]->s, i < t ? ' ' : '\n');
      }
    else if (t < m - 1)
      S (n, r - n, t + 1, s[t] = w);
}

int main (int C, B ** A)
{
  int i = 0, g, n = 0;
  B *p;
  while (--C)
    for (p = *++A; n < 127 && *p;)
      c[*p++]++, n++;
  for (; p = x[i++]; u (p))
    if (g = k (p))
      (l[g] = *(l[g] ? &l[g]->n : &h[g]) = F++)->s = p;
  while (++m < 128)
    S (127, n, 0, h[127]);
  return a;
}
However, catching the gist of its purpose, or the algorithms employed, is another thing. (For the record, it "finds best anagrams for word or phrase given as program arguments".) Although I'd argue that understanding this IOCCC program is easier than understanding that shuffle sort algorithm.
Post subject: Re: What is the logic behind the smoothsort algorithm?
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
The code you quoted is pretty obfuscated despite the airy and well-commented appearance. Here is some documentation I found about the algorithm. http://www.cs.utexas.edu/~EWD/transcriptions/EWD07xx/EWD796a.html http://www.cs.utexas.edu/users/EWD/ewd07xx/EWD796a.PDF
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Derakon wrote:
just assemble a set of screenshots into, say, a 4x4 grid, instead of trying to break them up into these irregular shapes. Barring things like the X1/X2 dual TAS, all images on a given page should have the same proportions since they're for the same console.
That is not really a concern at all. Different size screenshots work just fine with this engine, and are not a source of troubles. The trouble comes from those images that are treated as inline elements -- mixed with text such as to decorate the beginning of a paragraph.
Post subject: Re: About the download links.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
The file links are shown in the order they were added to the database. Usually the AVI link is added first, but in this case, the AVI was replaced so a new link became the last entry. You're right, probably would be better to have them always in a set order... Maybe I'll change that some day.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
Ferret Warlord wrote:
Small bug with this new method.<...> Instead of the images standing to the left of the text in the header where I want them, they're standing on top.
Yeah, I'm aware of this. I asked on the IRC channel a few days ago if anyone knows a way to make TABLEs to be laid out in HTML using the same way as IMGs are: that they are treated as inline elements (i.e. not block elements), while still having a set width. Nobody could answer... It was suggested that I use the float:left property of CSS instead -- which I did, but it's not perfect.
Editor, Experienced Forum User, Published Author, Active player (296)
Joined: 3/8/2004
Posts: 7469
Location: Arzareth
For the record, here's how that image you used as an example, https://files.tasvideos.org/bisqwit/6a4ad3f.png , turns out when you remove white space: https://files.tasvideos.org/bisqwit/3ef30e3.png