Advertisement
ASP_Volume3 Games #53761

jPeaks (Tri-Peaks clone)

This code is a clone (almost) of the solitare game Tri-Peaks(tm?). For those that don't know how the game is played, there is a base card at the bottom of the playfield. You select a card which has a face value one higher or one lower than the current base card (ie. if your base card is a ten, then you may select a nine or a jack). Although it doesn't really matter, Aces count as LOW, and can be "looped" back around to a king. The goal of the game is to clear off all cards. Points are scored by the number of cards you remove without resorting to a new base card from the draw pile. The first card you remove is worth 1 point, the second is worth 2 points, the third is worth 3 points, etc... (The longest streak I've had is 15 cards!) Drawing a new base card from the draw pile will make you lose 5 points (you *can* go into negative points) and you will lose 5 points for each card left on the playfield when you start a new game unless your draw pile is empty. You get 25 points for each "jPeak" that you clear and an additional 25 points if you clear all three (total bonus = 100 points). This game features almost all of the statistic tracking of the original Tri-Peaks game except for the persistant data (ie. when you close the game, all stats are cleared - nothing is saved). This functionality wouldn't be too hard to add using the DataSet.(Read/Write)XML procedures. On the technical side of the coin, this application makes use of cards.dll for all of the card faces and card backs and illustrates the use of old-fashioned API calls, user-controls, shared member functions and variables, interfaces, and (what I believe to be) average-to-good OO technique(s). Whether or not you vote on this code is up to you, but I would greatly appreciate some constructive criticism of my code and comments. And lastly (but not leastly) enjoy this completely free game! =)

AI

AI Summary: This codebase represents a historical implementation of the logic described in the metadata. Our preservation engine analyzes the structure to provide context for modern developers.

Source Code
original-source
Upload
Original Comments (3)
Recovered from Wayback Machine