pongzip.zipwell I tried this on my laptop and it works except that you have to extract it to a regular folder and I cant get the sound to work also.
Works! No sound, it seems to be that the audio library you're using doesn't seem to support wave files with format other than PCM. If I substitute the .wav file with a PCM-encoded audio file, it works fine. Perhaps you can reencode your file to PCM and it should work then (did the sound work on your development machine?)
- the paddle isn't very responsive, to move it quickly we either have to bash the up/down keys (which is slow) or keep them pressed (which has a delay before you start moving). I know this comes from how keystrokes are handled in Windows, because I assume you are relying on the KeyUp/KeyDown events. To make this better, you can try not using the events but instead, in your game loop, checking the keyboard state to see if the up/down arrow keys are pressed or not, and react accordingly.
- there is something wrong with the collision detection at the edge of the paddles, the ball will start spasming inside the paddle instead of bouncing back at an angle, eventually coming back out the same way it entered. We'd have to see the code to diagnose this one.
- the AI is unbeatable.
- after some period of time, everything gets slower (not sure if this intended, but it does make the game easier).
Other than that it looks pretty good! Are you going to share the source code as well?
The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.
- Pessimal Algorithms and Simplexity Analysis