Advertisement Jump to content
  • Advertisement

vaneger

Member
  • Content Count

    668
  • Joined

  • Last visited

Community Reputation

100 Neutral

About vaneger

  • Rank
    Advanced Member
  1. vaneger

    Solving N-Puzzles

    Once more, and in English perhaps ?
  2. vaneger

    Solving N-Puzzles

    What are some methods for solving arbitrary N sized N puzzles ? How can I determine unsolvable configurations?
  3. What methods would be best suited for the task of pattern recognition within fingerprints?
  4. vaneger

    Present stats for RPGs to imbalanced?

    You just need to keep in mind a balance concept like A beats B, B beats C, and C beats A. Then you can do things like have an attack that debuffs you but hurts an opponent significantly - thus opening you up to a strong counter attack. Risk vs reward. You just need to make sure your abilities and weapons offer trade offs that won't overwhelm other abilities and weapons. You don't necessarily need X/2 stats so that each has an opposite. Another idea is to vary the value that matters in gaining HP for each class. For fighter class it would be strength and dexterity while mage type classes would be intelligence and dexterity perhaps. Making hp (and other things) based on balancing two stats will help convince players to diversify at the cost of hyper specialization. They won't be able to milk just one stat and be effective.
  5. vaneger

    GUI design programs

    I'm looking to find free GUI design programs that are compatible with DROID / IPhone so that I could prototype a GUI and/or be able to port the GUI itself with relative ease. I haven't had much luck in the free department, but I'm sure there must be some people out here that have.
  6. vaneger

    odd compression idea

    Quote:Original post by szecs What you (OP) are saying is: any files can be compressed to a smaller one. Is that right? If so, you can compress the compressed file again and again. Is that right? If so, than after the repeated compressions, you will get a one bit file (assuming, that the filesystem doesn't limited to byte resolution). Now, if you start to decompress, how do you want to get the original data back? I understand the pigeonhole principle and this does not apply to what I'm suggesting because we'd append an error checking code - which will necessarily make some longer outputs. What I'm proposing is trying to understand if we can use a CRC or some other error checking code to reduce the scope of the problem and then brute force a solution.
  7. vaneger

    odd compression idea

    So we could use error checking to compare the 'guessed' result and make some changes and test again ?
  8. vaneger

    odd compression idea

    I don't know much about how CRCs work, but I thought they could be used for error checking ?
  9. vaneger

    odd compression idea

    Also, I think you are forgetting the plan to have a CRC value to check against. I'm not wanting to pull numbers out of thin air - but deduce them from the operation used, the CRC and the remainder.
  10. vaneger

    odd compression idea

    Hmm indeed. That seems to prove that using AND is not going to work. What about OR or XOR though ?
  11. vaneger

    odd compression idea

    Given the operation AND and a value of 0, we know that because you have 0s across the board none of the bit values can both be true. So they are either all 0s or alternating 1s and 0s. I believe this leaves you with 6 possible outcomes to be tested.
  12. vaneger

    odd compression idea

    No. It won't be able to be actually 50% if one has to store some kind of crc value to make sure the decompressed data comes out correct. Depending on how long it takes to test all the possibilities, using this method to decompress a given set of data 1- 3 times will be time consuming.
  13. vaneger

    odd compression idea

    given two pieces of data of length N, one can use one of XOR,AND,OR to combine them together and get a single piece of data of length N. Based on which operation you choose you could reconstruct the two pieces of data, with a calculated amount of variations and a calculated amount of exact data. This would grant 50% compression to any data, but reconstructing the pieces would take potentially alot of time. What I don't know is, what would be the optimal method for sifting through the possibilities ?
  14. I do have a specific algorithm I'm trying to improve by learning this stuff, specifically trying to figure out MMX and the various SSE codes. I want to examine a file for redundancy at various bit sizes to determine what length of bits offers the most redundancy in a given file. From what I've read, one could code the comparisons using MMX/SSE code to compare multiple items in one instruction instead of having use higher level instructions that may take up more time. I can't test if this would actually improve the run time or not without learning how to implement mmx/sse .
  15. using a different thread would make some sense considering that the goal of one thread would be to process lobby functions while another thread(s) would process running instances.
  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

GameDev.net is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.

Sign me up!