• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.


  • Content count

  • Joined

  • Last visited

Community Reputation

1564 Excellent

About OandO

  • Rank
  1. Thank you, that's very helpful. One follow up question, does it matter which particular texture slots I use? For example, suppose GL_MAX_TEXTURE_IMAGE_UNITS = 2, would I be limited to the first two texture slots, or could I use say GL_TEXTURE5 and GL_TEXTURE6 so long as I'm not using more than two at once?
  2. A couple of questions about how OpenGL uses textures across vertex and fragment shaders. I've been working on a materials system, and I'm currently implementing a simple list of textures that are in use, to reduce the number of texture binds done if sequential materials use the same textures. If I'm understanding this correctly, I've found that the vertex shader and fragment shader have access to different numbers of texture slots, however the information here seems to be self-contradictory: https://www.khronos.org/opengl/wiki/Vertex_Texture_Fetch       I don't understand why this would be the case, or how to work with it. If I wanted to use a texture in the vertex, I'd have to bind it to one of the slots accessible by the vertex shader, but there's some additional cost to then accessing it in the fragment shader as well? I'm hoping someone can clarify this, as these two points seem to be at odds with each other.
  3. Possibly the most relevant piece of research you could do for your project: https://en.wikipedia.org/wiki/Dunning–Kruger_effect
  4. It would write my code for me, obviously.
  5. I've pretty much got it working now, thanks. (Curved shapes still need some perfection, though). Yeah I found the same thing. I never tracked down the exact problem, but something about the optimisations to region tests kept causing it to fail.
  6. Casey's video had been my main reference up to this point. I cut out many (all?) of the optimisations he presents, so I'm now testing all voronoi regions for containing the origin at each step; as if by magic it started working as intended. I've also implemented the tolerance in comparing progress towards the origin, and with a little tweaking round shapes are working far more reliably (I've yet to hit the iteration cap). Next step is to determine penetration depth for intersections, and then on to 3D. Thanks for the help, I'll be sure to report back the next time I break something! – On a side note, for round shapes I'm taking support points from the surface, not the core shape. The reason being I want to be able to transform rounded shapes, to get ovals, squished/skewed capsules etc. so factoring in the radius later on didn't seem like a viable option. So far it seems to be working well.
  7. I've been working on an implementation of GJK to determine the closest points between pairs of shapes. For the time being I'm working in 2D, my goal is to build a simplex as close to the origin as possible, and terminate when a 3-point simplex contains the origin. It's almost working correctly but there are a couple of cases which are still tripping me up. For implicit, curved shapes the algorithm regularly fails to converge, especially for relatively shallow penetrations. The chapter on GJK in Real-Time Collision Detection suggests a tolerance in the termination condition, but I can't figure out what exactly it's supposed to be tolerating... I suspect the problem has something to do with there being and infinite number of potential support points to choose from, but I'm uncertain of how to combat that.   The other problem is deciding what to do when a 2-point simplex passes directly through the origin. This seems common with curved shapes but I was also able to engineer situations where it would occur with polygons. Of course if a 2-point simplex is passing through the origin then the shapes are intersecting, but the aim is to build a complete simplex and use it later to determine penetration depth. When the origin lies on the line segment formed by a 2-point simplex, I can't create a valid search direction. I tried picking a random direction and working from there, but I found a large number of false positives reported, and wasn't able to reliably catch and fix these.
  8. typedef float flaot; // Quicker than learning to tpye accurately.
  9. Note to my future self: // FIXME - I wrote this file at 4am, re-read EVERYTHING
  10. I went out today and bought two new PlayStation 2 controllers so I can play my PS1/2 library again, so yes. Although (And I don't know if this is fair or just a prejudice I've picked up) I would expect to pay an awful lot less than something that played or looked like a modern game, regardless of how much fun it was.
  11. The first time I tried to do walking based on a (very much simplified) muscular system: https://www.youtube.com/watch?v=nQYu2wdnFRY
  12. The cards look fantastic, the map looks fantastic, the line art looks fantastic. Everything is tied together by a single visual theme... Why does the character art suddenly reject all that effort?
  13. Well yes, from a pure performance point of view, it's OK for a Quake-style of game (not so for something much bigger, though).   But my point about knowledge remains. In a game where several people compete, it can be troublesome to provide information to people that they actually can't know. Such as those shoot-through-wall aimbots, or other things. Imagine someone implements a minimap where enemies show as little dots (and nobody using the genuine client has such a mini-map). Imagine knowing what weapon, how much armour, and how much health your opponents have (when you shouldn't!), and where they hide. Imagine knowing which door they'll come through before they know (because you can "see through" the door). No player should ever know the whole world, normally. Not unless it doesn't matter anyway.   So have a little flag that tells you whether or not the receiving client can see this player (to tell them if the player should be visible at their end) and don't send the new data about that player if they aren't visible. Problem solved.