Jump to content


+ Sponsor
  • Content count

  • Joined

  • Last visited

  • Days Won


Asharonapaul last won the day on February 9

Asharonapaul had the most liked content!


About Asharonapaul

  • Rank
    The Non Believer of Beliefs
  • Birthday 03/09/1989

Profile Information

  • Gender
    Not Telling
  • Location
    Midwest US A
  • Interests
    writing, music, performance, game making, carpentry, luthier

RPG Maker Information

  • RM Skill -
    Jack of All Trades

Recent Profile Visitors

6,717 profile views
  1. biker concept

    I really enjoy the designs. you did awesome
  2. I feel like watching sheldon cooper talk about flags

    1. PhoenixSoul



      "Oh, what does this seven color striped flag stand for?"


      (Won't see that one among many others of the category because a lot of CBS show producers are Conservative Idiots.)

    2. Kayzee


      That reminds me of this video I saw...

    3. Asharonapaul
  3. how is everyone? I've been working lately. and drawing with friends

    1. PhoenixSoul


      Freezing my ass off...(the cold is persistent and it is painful so I often don't do a whole lot)

    2. Saeryen


      I'm alright. I feel a little alone, no one's talking to me much on here...

    3. Thomas Smith
  4. the feeling is gone now

    1. Saeryen


      I hope you mean your feeling of not being motivated is gone.

    2. PhoenixSoul


      Or is it a B.B. King reference (may he have been received by Eden...)

    3. Asharonapaul


      to wake up with music in the mind

  5. the motivation to make a game is just gone for now...

    1. Show previous comments  4 more
    2. Asharonapaul


      no. it's not low energy to my knowledge. coffee and food don't help

    3. Asharonapaul


      but generally, lack of nutrition can cause mental illness symptoms.

    4. lonequeso


      Fiiine. More espresso for me! :D


      Maybe your just burnt out. Try not to think about it too much. Whatever the cause, your brain needs a rest.

  6. I am, for the people

  7. Ambition for a Long While

    the book goes into depth on the pseudo code so you don't HAve to use it exactly as they frame. but I don't mind.
  8. Ambition for a Long While

    @Kayzee ah yes. I am following their pseudocode which is formated for a C lang or python for instance. never worked with pseudocode before, so I am not utilizing all that Ruby can offer.
  9. What I have been up to lately.

    woa. roguelikes seem difficult in that making a valid story behind procedural dungeons is complex. but if you don't think story matters, it's a win win
  10. I guess the ninja is unavailable, and shiggy is mute or something?

  11. Sudyg Woods in Khr'mast

    yo man. I have updated the trees since this was posted. but ya same project, different sites, same account
  12. Ambition for a Long While

    Oh wow. It's been a long while since I've blogged here. It's been a long time too, since I've belonged to an academia, or even dared to dream of university. Back in highschool, when geometry honors and pre calc were easy and full of joy to explore, I wanted to go to MIT. Everything I kept up on, was happening in MIT. AI, Robotics, all the things that were cutting edge were seemingly happening at MIT. Brilliance was what I thought of them. Fastforward and I'm a community college drop out with school debt living on government benefits struggling to understand the basic concepts of ACE or really any Object Oriented Language assisted Engine (like Unity, and so on). I had known about MIT open coarse-ware since I was enrolled in physics at a community college. I would watch a lecture on Electromagnetism every night, amazed with the content, thinking how cool it would be to use the information to build an electronic device never before seen. I ended up making a aluminium foil capacitor that held 2 volts for .25 seconds Now I'm here, finishing some reading on a MIT press book, Introduction to Algorithms. It's great. It talks about how the book is meant for not only a student teacher relationship, but also a reference manual for professional programmers, to help in creation/learning to create algorithms that always produce a given output from a provided input, are time efficient based on the resources available to execute the information, and without error. It's also a huge plunge into parts of math that remain unexplored for me. Like Weirmer functions, or newtons method, and some of finite math that's since slipped my mind after having tutored university students in the field. The first hurdle was getting the text book. It could not just be an ebook, I want to read it anywhere, and the entire planet isn't guaranteed to have the internet. And as I have learned, it may take me a long while to read all of what the book has to offer, the coarse I am following only has 25 lectures that cover a handful of chapters, wheras the book has a lot more chapters to offer. mainly the exploration of mathematics in it is of firm intrigue to me, should it suffice to be able to construct a method in ruby of it's principles, I should have no problem with the contents. Mom got me the book for an early birthday present. It's very well over 1200 pages. Just the preface alone was cause for me to desire to read chapter 1 the very next morning. All with the delighted hope of learning to craft algorithms that could solve and explore new aspects of reality for me. I began reading, and writing the exercises. I couldn't help be so excited about the idea of learning once more, in a field so vastly unlearned and yet so rewarding, that I upset a contact in a discord server. They ended up giving me a link to another discord server that focused on programming in general. I couldn't help but ignore the feeling of total devistation in having pissed someone off, for having found people that could help me grade myself as I progressed, so that I could correct myself and better apply my knowledge on the subjects in the book. Things checked out on my end for the answers. Such a short section with so much useful information, I had to keep going. after more principles, I had failed to realize something that should have been obvious, involving the direction of the book. regardless, I did my first problem of the book: I probably totally failed it, in that microsecond does not constitute 1000 of itself into a second. Had I paid attention in the non-existent weights and measures class they call elementary science, I would have known. But that's kind of a scaling issue as I found out from my implications. So one of the functions of f(n) was f(n) = log2(n) It wasn't so easy to solve. My first assumption was to create real values for n, and not some representative formula. My first attempts did not posses efficiency, because I am so under-educated about RUBY for one. After talking it over with ruby programmers on the server, I had arrived at this method for the solution My first thoughts are, why does that work. I still don't know. but if t is say, 2, the answer is 4, and so on, until we have a value where t = 1 second, it becomes large quickly. For a day the number n1 became so large that it was unmanageable for modern RUBY, so I had to introduce a factor. and being a decimal starting with 1 and having no other digit seems to have worked perfectly, scaling according to the t value. I did this sort of process for all 64 cells of the 8x8 table. Then I woke up and read chapter 2. And immediately was presented with a real world application for insertion_sort. An algorithm that mimics taking a handful of cards, and aligning them in a sequential order such that the elements are from least to greatest or greatest to least. It was also the first time I had seen pseudo code and attempted to use it as a structure for RUBY code. I toyed around with it for ages. Before reading the book further, and had hit a dead end. All of my debugging techniques couldn't make sense of the garbled mess of the array my method had made. When I read further, it explained that i = j = e. And its use of A[1..j-1] was saying what would happen in the next loop. def insertion_sort(an_array) size = an_array.length i = 0 while i < size current = an_array j = i while j > 0 and an_array[j-1] > current an_array[j] = an_array[j-1] j -= 1 end an_array[j] = current i += 1 end return an_array end def insertion_sort(an_array) size = an_array.length i = 0 while i < size current = an_array[i] j = i while j > 0 and an_array[j-1] > current an_array[j] = an_array[j-1] j -= 1 end an_array[j] = current i += 1 end return an_array end this produced this result: And what I had mentioned earlier, of this being so obvious now. I had made this function before when I was making Classical Age World. It was my sort method for arranging the NPCs in a 2d array into family trees with relationships. I know on my walmar machine it will bog down on 10K entries. It might be more efficient now with the latest RUBY. the time coefficient being defined as: * insertion sort – c1n2 Just from the table I had made, I know that N**2 is really not that great, but isn't the worse efficient coefficient algorithm. The worst on the table being, N! I went and did the method in GML, and it worked eventually. Now I can happily say I know an algorithm with it's application and relevance in programming. The book had me write an algorith to return Nil when a value is not in the array. To be honest I am not sure I understand the problem thorough. this was my guess at it Linear search: For j = 0 to A.length V = A[j] If A[j+1].defined? j = j + 1 else V = nil Break Anyways, I thought people would like to know about this particular journey as it develops.
  13. @Cookie Ninja you said your specialty was math. I made some program to do my MIT homework, and I fear it's ALL wrong. trying to scale some math so I don't get infinity as an answer

    1. Show previous comments  1 more
    2. Asharonapaul


      I had to fill out a table.A88LYLX.png
      I used ruby with my own methods. When I went to plug the answers into the f(n) on the left, it gave correct answers except for n log2(n) which I got WAY wrong apparently.

    3. Shiggy


      Sorry late answer
      Some of your results are weird, even simpler stuff like
       f(n) = n for 1 second , you should 1 million (because f(n) is in microseconds not miliseconds)

      so you need to solve f(n) = t (where t is your time in microseconds)
      you could make a program run loop n until f(n) > t and return n-1 but it might be a bit long to run (except for factorial 2^n maybe)

      so the other way is just to solve f(n) = t <=> n = g(t) where g is the reverse function of t
       Most of them are easy
      log2 n is 2^n
      sqrt(n) is n^2
      n is n
      but n log2 n is indeed trickier.
      After a quick  research I found this:

      Good luck
      Btw computations should be ok for ruby , you don't care about floating points and bignum support in ruby seems good (bignum and floats are the main thing to worry about when programming computation)

    4. Asharonapaul


      the answers quickly exceed a google plex, so I scaled with log10(n1)

  14. Song Skills

    Butterbeer song +1 Epic Wand *cursed state applied while owning wand +Skil learned Necromancy state soulless applied if ever used and target is incomplete. +Invisible state applied for as long as cloak is worn, once removed you join some which.