php.ComLanka.com PHP Tutorial ,PHP source code, PHP online example

Algorithms Arrays Passwords Uncategorized
Commerce Uncategorized
Databases Abstraction Layers Informix LDAP MS SQL MySQL ODBC PostgreSQL Uncategorized
Date & Time Calculators Conversion Translation Uncategorized
Discussion Chat Forums Guestbooks Polls Uncategorized
Email Validation Uncategorized
External Uncategorized
Files and Directories Uncategorized
Games Uncategorized
Graphics 3-D Graphs Resizing Thumbnails Uncategorized
HTML Forms Menus & Navigation Source Viewers Tables Templates Uncategorized
HTTP Authentication Cookies File Uploading Uncategorized
I18N Uncategorized
Math Uncategorized
Miscellaneous Uncategorized
Searching and Trees Uncategorized
Security Uncategorized
Text Uncategorized
Utilities Calendars Counters Link Checkers Weather Uncategorized
XML Uncategorized

php sample source codes
This class allows you to easily add a madlibs game to your website. You can load the madlib stories in via the file system or a database. The stories are chosen at random, and a form will be shown to the user to fill in their own words. You can use a few css styles to control how things look (madlibTable, madlibTitle, madlibStory, and madlibWord). <?php // // class.madlibs.php // version 1.0.0, 3rd September, 2003 // // Description // // This class allows you to easily add a madlibs game to your website. // You can load the madlib stories in via the file system or a database. // If using the file system, the stories must contain the title on the // first line and then story in the rest of the file. If using a database // then the schema is as follows: // // CREATE TABLE madlibs // ( // id int(11) NOT NULL auto_increment, // title varchar(255) NOT NULL default '', // story mediumtext NOT NULL, // PRIMARY KEY (id) // ) // // Stories are requied to have specific tags in them for replacement. The // format for the tags in the stories as '{TAGNAME}'. See the function // 'setDefaultTags' for a list of all default tags. The class already comes // loaded with a vast array of tags, though you can easily add to or remove // from that list at run time. // // Examples of use // // Using the file system: // // require 'class.madlibs.php'; // $ml = new madlibs(); // $ml->useFS('./stories', '.txt'); // $ml->displayMadlib(); // // Using the file system: // // require 'class.madlibs.php'; // $ml = new madlibs(); // $ml->useDB('username', 'password', 'madlibs', 'mydb', 'localhost'); // $ml->displayMadlib(); // // Examples of stories // // A simple test title // Yesterday, {OPPOSITESEX} and I went to the beach. We had a really // {ADJECTIVE} time! We {VERB-ED} with my {NOUN}. // // Feedback // // There is message board at the following address: // // http://php.amnuts.com/forums/index.php // // Please use that to post up any comments, questions, bug reports, etc. You // can also use the board to show off your use of the script. // // Support // // If you like this script, or any of my others, then please take a moment // to consider giving a donation. This will encourage me to make updates and // create new scripts which I would make available to you. If you would like // to donate anything, then there is a link from my website to PayPal. // // Andrew Collington, 2003 // php@amnuts.com, http://php.amnuts.com/ // class madlibs { var $useType; var $dbUser; var $dbPass; var $dbHost; var $dbName; var $dbTbl; var $dbID; var $fsPath; var $fsExt; var $inText; var $outText; var $tags; var $tagPositions; // // the constructor // function madlibs() { $this->useType = ''; $this->tagPositions = array(); $this->inText = array(); $this->outText = array(); $this->setDefaultTags(); } // // set the default replacement tags // function setDefaultTags() { $this->tags = array( 'VERB' => 'A verb', 'VERB-ED' => 'A verb ending in \'ed\'', 'VERB-ING' => 'A verb ending in \'ing\'', 'VERB-S' => 'A verb ending in \'s\'', 'NOUN' => 'A noun', 'NOUN-PLURAL' => 'A plural noun', 'ADJECTIVE' => 'An adjective', 'ADVERB' => 'An adverb', 'EMOTION' => 'An emotion', 'NUMBER' => 'A number', 'PLACE' => 'The name of a place', 'ROOM' => 'The name of a room', 'FOOD' => 'The name of some food', 'MALE' => 'A man\'s name', 'FEMALE' => 'A woman\'s name', 'OPPOSITESEX' => 'Name of a member of the opposite sex', 'SAMESEX' => 'Name of a member of the same sex', 'ANIMAL' => 'An animal', 'ANIMAL-PLURAL' => 'An animal (plural)', 'FUNNY' => 'Something funny', 'BODYPART' => 'A body part', 'BODYPART-PLURAL' => 'A body part (plural)', 'CELEBRITY' => 'The name of a celebrity', 'MADEUP' => 'Just make up a word' ); } // // allows you to add new tags to the list on the fly // $name is the tag name, eg, 'VERB' // $description is the text displayed to the user, eg, 'A verb' // function addTag($name, $description) { $this->tags[$name] = $description; return (array_key_exists($name, $this->tags)) ? TRUE : FALSE; } // // allows you to remove a tag from the tag list on the fly // $name is the tag name, eg, 'VERB' // function deleteTag($name) { if (array_key_exists($name, $this->tags)) { $this->tags[$name] = NULL; unset($this->tags[$name]); return TRUE; } else { return FALSE; } } // // sets the class to use a MySQL database for the story storage area // $user is the username used to access to database // $pass is the password for the user account // $table is the table name that stores the story information // $database is the name of the database that contains the $table // $host is the host address of the database // function useDB($user='username', $pass='password', $table='madlibs', $database='demo', $host='localhost') { $this->useType = 'db'; $this->dbUser = $user; $this->dbPass = $pass; $this->dbHost = $host; $this->dbName = $database; $this->dbTbl = $table; $this->dbID = NULL; $this->dbID = @mysql_connect($this->dbHost, $this->dbUser, $this->dbPass) or die("Unable to connect to mysql server: {$this->dbHost}"); @mysql_select_db($this->dbName, $this->dbID) or die("Unable to select database: {$this->dbName}"); } // // sets the class to use the file system for the story storage area // $path is the path to the story files // $extension is the extensions of the story files, including the period if one is used // the name of the file is arbitrary // function useFS($path = 'stories', $extension = '.txt') { $this->useType = 'fs'; $this->fsPath = $path; $this->fsExt = $extension; } // // loads the story information // function getStory() { if ($this->useType == 'db') { $sql = "SELECT * FROM {$this->dbTbl} " . ($_POST['id'] ? "WHERE id = {$_POST['id']}" : "ORDER BY RAND() LIMIT 1"); $result = @mysql_query($sql, $this->dbID); if (mysql_num_rows($result)) { $data = @mysql_fetch_object($result); $this->inText['id'] = $data->id; $this->inText['title'] = trim(stripslashes($data->title)); $this->inText['story'] = trim(stripslashes($data->story)); } } else if ($this->useType == 'fs') { if ($_POST['id']) { $file = $_POST['id']; } else { $filelist = array(); if ($dir = @opendir($this->fsPath)) { while (($file = readdir($dir)) !== FALSE) { if ($file == '.' || $file == '..') continue; if (preg_match("/{$this->fsExt}$/", $file)) { $filelist[] = $file; } } closedir($dir); srand((float)microtime() * 10000000); $file = $filelist[array_rand($filelist)]; } } $data = array(); $data = @file($this->fsPath . '/' . $file); if (!empty($data)) { $this->inText['id'] = $file; $this->inText['title'] = trim(@array_shift($data)); $this->inText['story'] = trim(@join('', $data)); } } } // // displays the madlib // if the form hasn't been displayed then it will show the form, else it // will show the story complete with madlib sustitutions // function displayMadlib() { $this->getStory(); if (!isset($_POST['positions'])) { if ($this->inText['story']) { $this->getTagPositions(); $this->showForm(); } else { echo 'No madlib story has been loaded.'; } } else { if ($this->inText['story']) { $this->decompPositions($_POST['positions']); $this->replaceTags($_POST['word']); echo '<div class="madlibTitle">', $this->outText['title'], "</div>\n"; echo '<div class="madlibStory">', nl2br($this->outText['story']), "</div>\n"; } else { echo 'No madlib story has been loaded.'; } } } // // displays the form the user's words // function showForm() { echo '<form name="madlibForm" action="', $_SERVER['PHP_SELF'], '" method="post">'; echo '<input type="hidden" name="id" value="', urlencode($this->inText['id']), '">'; echo '<input type="hidden" name="positions" value="', $this->compPositions(), '">'; echo "<p>Please enter the following:</p>\n"; echo '<table border="0" cellpadding="5" cellspacing="0" class="madlibTable">'; foreach ($this->tagPositions as $id => $type) { echo '<tr><td>', $this->tags[$type], '</td><td><input type="textbox" name="word[', $id, ']"></td></tr>', "\n"; } echo '<tr><td colspan="2" align="center"><input type="submit" value="see your madlib"></td></tr>'; echo "\n</table>\n</form>\n"; } // // determines where in the tags lie // function getTagPositions() { foreach ($this->tags as $key => $desc) { $positions = array(); $tag = '{' . $key . '}'; $positions = $this->multi_strpos($tag, $this->inText['story']); if (!empty($positions)) { foreach ($positions as $place) { $this->tagPositions[$place] = $key; } } } ksort($this->tagPositions); } // // does the tag substitution for the finished story // function replaceTags($word_list) { $this->outText = $this->inText; if (!empty($this->tagPositions)) { $tags = array_reverse($this->tagPositions, TRUE); foreach ($tags as $position => $type) { $tag = '{' . $type . '}'; $this->outText['story'] = substr_replace($this->outText['story'], '<span class="madlibWord">' . $word_list[$position] . '</span>', $position, strlen($tag)); } } } // // function to determine multiple occurrences of a word in a string // from a post by arduenn at hotpop dot com on the php.net comments // function multi_strpos($pattern, $sequence) { $n = -1; while (ereg($pattern, $sequence)) { $n++; $fragment = split($pattern, $sequence); $trimsize = (strlen($fragment[0]))+1; $sequence = "*".substr($sequence, $trimsize); $position[$n] = (strlen($fragment[0]) + $position[($n-1)]); } return $position; } // // compresses the tag position array for use in a form // function compPositions() { return urlencode(base64_encode(serialize($this->tagPositions))); } // // decompresses the tag information array from a string // $positions is the compressed structure // function decompPositions($positions) { $this->tagPositions = unserialize(base64_decode(urldecode($positions))); } } ?>
This is a reproduction of the famous BattleShips game. It was developed as a submission to the PHP Programming Contest at PHP-Editors.com and it came first place. Follow the link for code and live game. http://www.php-editors.com/games/battleships/
Prizes winning games from the www.php-editors.com May 2003 PHP Programming Contest. This is a 2 player game of Battleships. See the contests details and results: http://www.php-editors.com/contests_2_archive.php#a See the game in action: http://www.php-editors.com/games/battleships/login_gui.php
This is a winner of the Codewalkers.com Coding Contest. This script will play blackjack. <? /* ******************************************************************************************* * Artificial Black Jack Player by Thomas Ilsche for codewalkers.com contest * * Author: Thomas Ilsche * Date: 29 FEB 2004 {1078086447} * * Notes: * I removed the comments to hide my poor language skills, they were in german anyway. * Alot of the coding is sloppy due to me having so few time. * At some parts the readability is sacrificed to performance. * * License Information: * - This may be placed on codewalkers.com and zend.com. * - Commercial use or any use with the intention to make any kind of profit is scritly prohibited. * - This software is provided 'as-is', without any express or implied warranty. * - The origin of this software must not be misrepresented; you must not claim that you wrote the original software. * - This notice may not be removed or altered from any source distribution. * *******************************************************************************************/ include('blackjacklib.php'); $default_comp_stats = array ( 1 => array ( 0 => 0, 1 => 0, 2 => 0, 3 => 0, 4 => 0, 5 => 0, 6 => 0, 7 => 0, 8 => 0, 9 => 0, 10 => 0, 11 => 0, 12 => 0, 13 => 0, 14 => 0, 15 => 0, 16 => 0, 17 => 0.0570454061951, 18 => 0.199487346033, 19 => 0.342146429652, 20 => 0.48551435914, 21 => 0.860615842858, 22 => 0.139384157142, ), 2 => array ( 0 => 0, 1 => 0, 2 => 0, 3 => 0, 4 => 0, 5 => 0, 6 => 0, 7 => 0, 8 => 0, 9 => 0, 10 => 0, 11 => 0, 12 => 0, 13 => 0, 14 => 0, 15 => 0, 16 => 0, 17 => 0.13000919079, 18 => 0.265417781938, 19 => 0.397338658137, 20 => 0.522995153296, 21 => 0.643406574144, 22 => 0.356593425856, ), 3 => array ( 0 => 0, 1 => 0, 2 => 0, 3 => 0, 4 => 0, 5 => 0, 6 => 0, 7 => 0, 8 => 0, 9 => 0, 10 => 0, 11 => 0, 12 => 0, 13 => 0, 14 => 0, 15 => 0, 16 => 0, 17 => 0.125457133475, 18 => 0.257369693095, 19 => 0.383644800203, 20 => 0.5062182003, 21 => 0.622782192694, 22 => 0.377217807306, ), 4 => array ( 0 => 0, 1 => 0, 2 => 0, 3 => 0, 4 => 0, 5 => 0, 6 => 0, 7 => 0, 8 => 0, 9 => 0, 10 => 0, 11 => 0, 12 => 0, 13 => 0, 14 => 0, 15 => 0, 16 => 0, 17 => 0.122514282649, 18 => 0.245983649641, 19 => 0.368465729832, 20 => 0.486277590484, 21 => 0.600112717333, 22 => 0.399887282667, ), 5 => array ( 0 => 0, 1 => 0, 2 => 0, 3 => 0, 4 => 0, 5 => 0, 6 => 0, 7 => 0, 8 => 0, 9 => 0, 10 => 0, 11 => 0, 12 => 0, 13 => 0, 14 => 0, 15 => 0, 16 => 0, 17 => 0.117813998733, 18 => 0.24099629412, 19 => 0.359066128325, 20 => 0.470108203242, 21 => 0.578365780329, 22 => 0.421634219671, ), 6 => array ( 0 => 0, 1 => 0, 2 => 0, 3 => 0, 4 => 0, 5 => 0, 6 => 0, 7 => 0, 8 => 0, 9 => 0, 10 => 0, 11 => 0, 12 => 0, 13 => 0, 14 => 0, 15 => 0, 16 => 0, 17 => 0.115284769236, 18 => 0.229631108316, 19 => 0.344878360904, 20 => 0.454945711424, 21 => 0.560977950518, 22 => 0.439022049482, ), 7 => array ( 0 => 0, 1 => 0, 2 => 0, 3 => 0, 4 => 0, 5 => 0, 6 => 0, 7 => 0, 8 => 0, 9 => 0, 10 => 0, 11 => 0, 12 => 0, 13 => 0, 14 => 0, 15 => 0, 16 => 0, 17 => 0.369845383448, 18 => 0.507909062524, 19 => 0.58613290643, 20 => 0.664866570461, 21 => 0.738454044497, 22 => 0.261545955503, ), 8 => array ( 0 => 0, 1 => 0, 2 => 0, 3 => 0, 4 => 0, 5 => 0, 6 => 0, 7 => 0, 8 => 0, 9 => 0, 10 => 0, 11 => 0, 12 => 0, 13 => 0, 14 => 0, 15 => 0, 16 => 0, 17 => 0.12931666408, 18 => 0.489886888171, 19 => 0.618762805821, 20 => 0.687802331292, 21 => 0.757344271656, 22 => 0.242655728344, ), 9 => array ( 0 => 0, 1 => 0, 2 => 0, 3 => 0, 4 => 0, 5 => 0, 6 => 0, 7 => 0, 8 => 0, 9 => 0, 10 => 0, 11 => 0, 12 => 0, 13 => 0, 14 => 0, 15 => 0, 16 => 0, 17 => 0.120624704665, 18 => 0.235313337657, 19 => 0.588262968352, 20 => 0.709005522859, 21 => 0.769933817328, 22 => 0.230066182672, ), 10 => array ( 0 => 0, 1 => 0, 2 => 0, 3 => 0, 4 => 0, 5 => 0, 6 => 0, 7 => 0, 8 => 0, 9 => 0, 10 => 0, 11 => 0, 12 => 0, 13 => 0, 14 => 0, 15 => 0, 16 => 0, 17 => 0.112407366253, 18 => 0.224319932896, 19 => 0.33679228001, 20 => 0.674611000253, 21 => 0.787168274661, 22 => 0.212831725339, ), ); function get_microtime() { list($usec, $sec) = explode(' ', microtime()); return ((float)$usec + (float)$sec); } function best_val($hand) { $sum = 0; $aces = 0; foreach($hand as $card) { if ($card > 9) { $sum += 10; } else { if ($card == 1) { $sum++; $aces++; } else { $sum += $card; } } } while ($aces && ($sum + 10) <= 21) { $sum += 10; $aces--; } return $sum; } $sub_start = get_microtime(); $rules = StartGame(); $x = $rules['decks'] * 4; $deck = array(1=>$x,2=>$x,3=>$x,4=>$x,5=>$x,6=>$x,7=>$x,8=>$x,9=>$x,10=>4*$x); while (1) { if (isset($result)) $bet = min($rules['maximumbet'],$result['money']); else $bet = $rules['maximumbet']; $result = MakeBet($bet); $deck[min(10,$result['dealercards'][0])]--; $deck[min(10,$result['yourcards'][0][0])]--; $deck[min(10,$result['yourcards'][0][1])]--; $first = true; $comp_stats_calced = false; while ($result['status'] == 'YOURTURN') { $e_win = array(); $last_was_hit = false; $hand_points = 0; $aces = 0; foreach($result['yourcards'][$result['activehand']] as $card) { if ($card > 9) { $hand_points += 10; } else { if ($card == 1) { $hand_points++; $aces++; } else { $hand_points += $card; } } } $best_hand_points = $hand_points; $best_aces = $aces; while ($best_aces && ($best_hand_points+10) <= 21) { $best_hand_points += 10; $best_aces--; } if ($best_hand_points == 21) { $result = PlayStand(); } else { $activehand_count = count($result['yourcards'][$result['activehand']]); if ($rules['double'] && $first && ( $result['money'] >= $result['currentbet']) ) { check_comp_stats(); $e_win['double'] = expected_win_double($hand_points, $deck, $aces); } else { $e_win['double'] = -1; } if ( $rules['split'] && ( $activehand_count == 2 ) && ($result['yourcards'][$result['activehand']][0] == $result['yourcards'][$result['activehand']][1]) && ( $result['money'] >= $result['currentbet']) ) { check_comp_stats(); $recursion = 0; $deck_cards_left = array_sum($deck) - 1; if ($deck_cards_left >= 7) { $e_win['split'] = expected_win_draw_low($hand_points/2, $deck, $aces/2)*2 - 1; } elseif ($deck_cards_left == 2) { $e_win['split'] = expected_win_double($hand_points/2, $deck, $aces/2)*2 - 1; } elseif ($deck_cards_left < 2) { $e_win['split'] = -1; } elseif ($deck_cards_left % 2 == 0) { $cardsleft = $deck_cards_left / 2; $e_win['split'] = expected_win_draw_cardsleft($hand_points/2, $deck, $aces/2)*2 - 1; } else { $cardsleft = floor($deck_cards_left / 2); $e_win['split'] = expected_win_draw_cardsleft($hand_points/2, $deck, $aces/2); $cardsleft++; $e_win['split'] += expected_win_draw_cardsleft($hand_points/2, $deck, $aces/2) - 1; } } else { $e_win['split'] = -1; } if ( ($hand_points < 12) && ($aces == 0) && ( array_sum($deck) > 15 ) ) { if ( ( $e_win['split'] > 0 ) || ( $e_win['double'] > 0 ) ) { $recursion = 0; $e_win['hit'] = expected_win_draw_low($hand_points, $deck, $aces); } $e_win['hit'] = 1; $e_win['stand'] = -1; } else { $checked = check_comp_stats(); if ( ( array_sum($deck) < 11 ) && ( get_microtime() - $sub_start < 45 ) ) { if (!$checked) { check_comp_stats(true); } $e_win['hit'] = expected_win_draw_total_enum($hand_points, $deck, $aces); $e_win['stand'] = expected_win_stop($hand_points,$deck,$aces); } elseif ( ( array_sum($deck) < 50) && ( get_microtime() - $sub_start < 45 ) ) { if (!$checked) { check_comp_stats(true); } $recursion = 0; $e_win['stand'] = expected_win_stop($hand_points,$deck,$aces); $e_win['hit'] = expected_win_draw_slow($hand_points,$deck,$aces); } elseif ( ( get_microtime() - $sub_start ) > 45 * ( 1 - array_sum($deck) / ( $rules['decks'] * 52 ) ) ) { $recursion = 0; $e_win['stand'] = expected_win_stop($hand_points,$deck,$aces); $e_win['hit'] = expected_win_draw_hurry($hand_points,$deck,$aces); } else { $recursion = 0; $e_win['stand'] = expected_win_stop($hand_points,$deck,$aces); $e_win['hit'] = expected_win_draw($hand_points,$deck,$aces); if (abs($e_win['stand'] - $e_win['hit']) < 0.1) { if (!$checked) { check_comp_stats(true); } $e_win['hit'] = expected_win_draw_slow($hand_points,$deck,$aces); $e_win['stand'] = expected_win_stop($hand_points,$deck,$aces); } } } if ($first && $rules['surrender'] && ( max($e_win) < 0.5 ) ) { $last_decition = 'surrender'; $result = PlaySurrender(); } elseif ($e_win['stand'] == max($e_win)) { $result = PlayStand(); } elseif ($e_win['double'] == max($e_win)) { $last_active_hand = $result['activehand']; $result = PlayDouble(); $deck[min(10,end($result['yourcards'][$last_active_hand]))]--; } elseif ($e_win['hit'] == max($e_win)) { $last_active_hand = $result['activehand']; $result = PlayHit(); $deck[min(10,end($result['yourcards'][$last_active_hand]))]--; } elseif ($e_win['split'] == max($e_win)) { $last_active_hand = $result['activehand']; $result = PlaySplit(); $deck[min(10,end($result['yourcards'][$last_active_hand]))]--; $deck[min(10,end($result['yourcards'][$last_active_hand+1]))]--; } } $first = false; } for ($i = 1;$i < count($result['dealercards']); $i++) { $deck[min(10,$result['dealercards'][$i])]--; } } function expected_win_draw_slow($hand_points,$deck,$aces) { if ( ( $hand_points > 20 ) || ( $aces > 2 ) || ( $hand_points == 11 && $aces > 0 ) ) { return expected_win_stop($hand_points, $aces); } $cards_in_deck = array_sum($deck); if ( $cards_in_deck <= 1 ) { return expected_win_stop($hand_points, $aces); } $e_w = 0; $aces++; foreach ($deck as $points => $count) { if ($count > 0) { if ($hand_points + $points > 20) { $e_w += expected_win_stop($hand_points + $points,$aces) * $count / $cards_in_deck; } else { $deck[$points]--; $e_w += max(expected_win_stop($hand_points + $points,$aces), expected_win_draw_slow($hand_points + $points,$deck,$aces) ) * $count / $cards_in_deck; $deck[$points]++; } } if ($points == 1) $aces--; } return $e_w; } function expected_win_draw($hand_points,$deck,$aces) { if ( ( $hand_points > 20) || ( $hand_points == 11 && $aces > 0 ) ) { return expected_win_stop($hand_points, $deck, $aces); } if ( ( ($GLOBALS['recursion'] + $aces * 2 ) > 4) && ($hand_points > 18 || $aces > 1) ) { return expected_win_stop($hand_points, $aces); } $cards_in_deck = array_sum($deck); $e_w = 0; $GLOBALS['recursion']++; $aces++; foreach ($deck as $points => $count) { if ($count > 0) { if ($hand_points + $points > 20) { $e_w += expected_win_stop($hand_points + $points,$aces) * $count / $cards_in_deck; } else { $deck[$points]--; $e_w += max(expected_win_stop($hand_points + $points,$aces), expected_win_draw($hand_points + $points,$deck,$aces) ) * $count / $cards_in_deck; $deck[$points]++; } } if ($points == 1) $aces--; } $GLOBALS['recursion']--; return $e_w; } function expected_win_stop($hand_points,$aces) { if ($hand_points > 21) { return $GLOBALS['comp_stats'][22]; } while ($aces && ($hand_points+10) <= 21) { $hand_points += 10; $aces--; } return $GLOBALS['comp_stats'][$hand_points-1] + $GLOBALS['comp_stats'][$hand_points] + $GLOBALS['comp_stats'][22] * 2; } function calc_comp_stats($hand_points, $deck, $aces, $p) { $best_hand_points = $hand_points; $best_aces = $aces; while ($best_aces && ($best_hand_points+10) <= 21) { $best_hand_points += 10; $best_aces--; } if (($best_hand_points > 17) || ( $best_hand_points == 17 && ( $GLOBALS['rules']['standsoft17'] || ( $hand_points == $best_hand_points ) ) ) ) { $GLOBALS['comp_stats'][min($best_hand_points,22)] += $p; } else { $cards_in_deck = array_sum($deck); if ($cards_in_deck > 0) { foreach ($deck as $points => $count) { if ($count > 0) { $deck[$points]--; calc_comp_stats($hand_points+$points, $deck, ($points == 1) ? $aces+1 : $aces, $p * $count / $cards_in_deck); $deck[$points]++; } } } else { $GLOBALS['comp_stats'][min($best_hand_points,22)] += $p; } } } function expected_win_draw_hurry($hand_points,$deck,$aces) { if ($hand_points > 20) { return expected_win_stop($hand_points, $aces); } if ( ( ($GLOBALS['recursion'] + $aces * 2 ) > 3) && ($hand_points > 17 || $aces > 0) ) { return expected_win_stop($hand_points, $aces); } $cards_in_deck = array_sum($deck); $e_w = 0; $GLOBALS['recursion']++; $aces++; foreach ($deck as $points => $count) { if ($count > 0) { if ($hand_points + $points > 20) { $e_w += expected_win_stop($hand_points + $points,$aces) * $count / $cards_in_deck; } else { $deck[$points]--; $e_w += max(expected_win_stop($hand_points + $points,$aces), expected_win_draw_hurry($hand_points + $points,$deck,$aces) ) * $count / $cards_in_deck; $deck[$points]++; } } if ($points == 1) $aces--; } $GLOBALS['recursion']--; return $e_w; } function expected_win_draw_cardsleft($hand_points,$deck,$aces) { if ($hand_points > 20) { return expected_win_stop($hand_points, $aces); } if ( $GLOBALS['recursion'] >= $GLOBALS['cardsleft'] ) { return expected_win_stop($hand_points, $aces); } $cards_in_deck = array_sum($deck); $e_w = 0; $GLOBALS['recursion']++; $aces++; foreach ($deck as $points => $count) { if ($count > 0) { if ($hand_points + $points > 20) { $e_w += expected_win_stop($hand_points + $points,$aces) * $count / $cards_in_deck; } else { $deck[$points]--; $e_w += max(expected_win_stop($hand_points + $points,$aces), expected_win_draw_cardsleft($hand_points + $points,$deck,$aces) ) * $count / $cards_in_deck; $deck[$points]++; } } if ($points == 1) $aces--; } $GLOBALS['recursion']--; return $e_w; } function expected_win_double($hand_points,$deck,$aces) { $cards_in_deck = array_sum($deck); $e_w = 0; $aces++; foreach ($deck as $points => $count) { if ($count > 0) { $e_w += expected_win_stop($hand_points + $points,$aces) * $count / $cards_in_deck; } if ($points == 1) $aces--; } return $e_w*2-1; } function check_comp_stats($enforce = false) { global $comp_stats_calced; if (!$comp_stats_calced || $enforce) { global $deck,$default_comp_stats,$comp_stats,$result,$deck; if (array_sum($deck) > 70) { $comp_stats = $default_comp_stats[min(10,$result['dealercards'][0])]; } else { $comp_stats = array(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0); calc_comp_stats(min(10,$result['dealercards'][0]),$deck,($result['dealercards'][0]==1)?1:0,1); $s = 0; for ($i = 0;$i < 22;$i++) { $s += $comp_stats[$i]; $comp_stats[$i] = $s; } } $comp_stats_calced = true; return true; } else return false; } function expected_win_draw_total_enum($hand_points,$deck,$aces) { if ($hand_points > 20) { return expected_win_stop_total_enum($hand_points, $deck, $aces); } $cards_in_deck = array_sum($deck); if ($cards_in_deck <= 1) { return expected_win_stop_total_enum($hand_points, $deck, $aces); } $e_w = 0; $aces++; foreach ($deck as $points => $count) { if ($count > 0) { if ($hand_points + $points > 20) { $e_w += expected_win_stop_total_enum($hand_points + $points,$deck,$aces) * $count / $cards_in_deck; } else { $deck[$points]--; $e_w += max(expected_win_stop_total_enum($hand_points + $points,$deck,$aces), expected_win_draw_total_enum($hand_points + $points,$deck,$aces) ) * $count / $cards_in_deck; $deck[$points]++; } } if ($points == 1) $aces--; } return $e_w; } function expected_win_stop_total_enum($hand_points,$deck,$aces) { global $result; if ($hand_points > 21) { return calc_comp_stats_total_enum_burst(min(10,$result['dealercards'][0]), $deck, (min(10,$result['dealercards'][0]) == 1) ? 1 : 0, 1); } while ($aces && ($hand_points+10) <= 21) { $hand_points += 10; $aces--; } $GLOBALS['total_enmum_hand_points'] = $hand_points; return calc_comp_stats_total_enum(min(10,$result['dealercards'][0]), $deck,(min(10,$result['dealercards'][0]) == 1) ? 1 : 0, 1); } function calc_comp_stats_total_enum($hand_points, $deck, $aces, $p) { $best_hand_points = $hand_points; $best_aces = $aces; while ($best_aces && ($best_hand_points+10) <= 21) { $best_hand_points += 10; $best_aces--; } if (($best_hand_points > 17) || ( $best_hand_points == 17 && ( $GLOBALS['rules']['standsoft17'] || ( $hand_points == $best_hand_points ) ) ) ) { if ($best_hand_points > 21) { return 2 * $p; } elseif ($best_hand_points > $GLOBALS['total_enmum_hand_points']) { return 0; } elseif ($best_hand_points < $GLOBALS['total_enmum_hand_points']) { return 2 * $p; } elseif ($best_hand_points == $GLOBALS['total_enmum_hand_points']) { return $p; } } else { $cards_in_deck = array_sum($deck); if ($cards_in_deck > 0) { $player_win = 0; foreach ($deck as $points => $count) { if ($count > 0) { $deck[$points]--; $player_win += calc_comp_stats_total_enum($hand_points+$points, $deck, ($points == 1) ? $aces+1 : $aces, $p * $count / $cards_in_deck); $deck[$points]++; } } return $player_win; } else { if ($best_hand_points > 21) { return 2 * $p; } elseif ($best_hand_points > $GLOBALS['total_enmum_hand_points']) { return 0; } elseif ($best_hand_points < $GLOBALS['total_enmum_hand_points']) { return 2 * $p; } elseif ($best_hand_points == $GLOBALS['total_enmum_hand_points']) { return $p; } } } } function calc_comp_stats_total_enum_burst($hand_points, $deck, $aces, $p) { $best_hand_points = $hand_points; $best_aces = $aces; while ($best_aces && ($best_hand_points+10) <= 21) { $best_hand_points += 10; $best_aces--; } if (($best_hand_points > 17) || ( $best_hand_points == 17 && ( $GLOBALS['rules']['standsoft17'] || ( $hand_points == $best_hand_points ) ) ) ) { if ($best_hand_points > 21) { return $p; } else { return 0; } } else { $cards_in_deck = array_sum($deck); if ($cards_in_deck > 0) { $player_win = 0; foreach ($deck as $points => $count) { if ($count > 0) { $deck[$points]--; $player_win += calc_comp_stats_total_enum_burst($hand_points+$points, $deck, ($points == 1) ? $aces+1 : $aces, $p * $count / $cards_in_deck); $deck[$points]++; } } return $player_win; } else { if ($best_hand_points > 21) { return $p; } else { return 0; } } } } function expected_win_draw_low($hand_points,$deck,$aces) { if ($hand_points > 20) { return expected_win_stop($hand_points, $deck, $aces); } if ( ( ($GLOBALS['recursion'] + $aces * 2 ) > 4) && ($hand_points > 18 || $aces > 1) ) { return expected_win_stop($hand_points, $deck, $aces); } if ( $GLOBALS['recursion'] == 3) { for ($i = 3;$i < 8;$i+=2) { $deck[$i] += $deck[$i-1]; $deck[$i-1] = 0; } } if ( $GLOBALS['recursion'] == 4) { $deck[4] += $deck[3] + $deck[5]; $deck[3] = 0; $deck[5] = 0; } $cards_in_deck = array_sum($deck); $e_w = 0; $GLOBALS['recursion']++; $aces++; foreach ($deck as $points => $count) { if ($count > 0) { if ($hand_points + $points > 20) { $e_w += expected_win_stop($hand_points + $points,$aces) * $count / $cards_in_deck; } else { $deck[$points]--; $e_w += max(expected_win_stop($hand_points + $points,$aces), expected_win_draw_low($hand_points + $points,$deck,$aces) ) * $count / $cards_in_deck; $deck[$points]++; } } if ($points == 1) $aces--; } $GLOBALS['recursion']--; return $e_w; } ?>
This is a winner from the PHP Coding Contest at Codewalkers.com Given a list of words provided by wordlist.txt, this script will create a crossword puzzle. <? /* Crossing Words for Codewalkers PHP Coding Contest of July 2002 (http://codewalkers.com/php-contest.php) Author ngel Fenoy from Arenys de Mar, Barcelona. */ set_time_limit($time_limit = 30); $t1 = time(); //error_reporting(E_ALL); mt_srand((double)(microtime()*100000000)); echo "<html> <head> <meta http-equiv='Content-Type' content='text/html; charset=ISO-8859-1'> <title>Crossing Words - Codewalkers PHP Coding Contest - July 2002</title> <style type='text/css'> th, td, body { font-family: monospace; font-size: 12px } .marc { background-color: #667966; color: #b0b0b0 } .limit { background-color: #d0e0d0; color: #c0c0c0 } .blanc { background-color: #d0e0d0; color: #f9fff9 } .connector { background-color: #494900; color: #ffffff } .filled { background-color: #004949; color: #ffffff } </style> </head> <body text='#000000' bgcolor='#ffffff'> "; define('N20', 20); define('N19', N20 - 1); define('N21', N20 + 1); define('N22', N20 + 2); define('N2222', N22 * N22); define('N2221', N2222 - 1); define('N2200', N2222 - N22); $file = "wordlist.txt"; if (! file_exists($file)) die("File <b>$file</b> inexistent. Matt's fault ;)</body></html>"); if (! is_readable($file)) die("File <b>$file</b> is not readable. Matt's fault ;)(</body></html>"); $arrfile = file($file); $lens = array_pad(array(), 21, 0); foreach($arrfile as $n => $wordn) { $lens[strlen($arrfile[$n] = trim($wordn))] ++; } $sum = 0; foreach($lens as $len => $q) { $sum += $q; if ( ($sum > 160 and $len > 5) or ($sum > 140 and $len > 6) or ($sum > 120 and $len > 7) or ($sum > 99 and $len > 8) ) { define('MAXW', $len); define('MAXW1', MAXW + 1); break; } } $base_words = array(); foreach($arrfile as $n => $wordn) { if (strlen($t = trim($wordn)) > (MAXW1)) continue; $base_words[$n] = $t; } $base_puzzle = str_repeat('0', N22) . str_repeat('0' . str_repeat('.', N20) . '0', N20) . str_repeat('0', N22); $best_score = 0; $best_puzzle = ''; $the_end = false; while (! $the_end) { $magics = array(); for ($n = 2; $n < N21; $n++) { $a = array(); for ($r = 2; $r < ($n + 2); $r++) { $a[] = $r; } uasort($a, 'cmp_magic'); $magics[$n] = $a; } $arr_words = $base_words; uasort($arr_words, 'cmp'); $words = ';' . implode(';', $arr_words) . ';'; $puzzle = $base_puzzle; $row = mt_rand(3, 10); $col = mt_rand(3, 10); $pos = N22 * $row + $col; $poss = array(); scan_pos($pos, 'h', true); $n_words = 1; while ($s = sizeof($poss)) { $p = array_shift($poss); if (scan_pos($p[0], $p[1], false)) { $n_words++; } if (time() - $t1 > $time_limit - 2) { $the_end = true; break; } } $n_connectors = $n_filleds = 0; $puzzle00 = str_replace('.', '0', $puzzle); for ($n = 0; $n < N2222; $n++) { if ($puzzle00[$n]) { if (($puzzle00[$n - 1] or $puzzle00[$n + 1]) and ($puzzle00[$n - N22] or $puzzle00[$n + N22])) { $n_connectors++; } else { $n_filleds++; } } } $score = ($n_words * 5) + ($n_connectors * 3) + $n_filleds; if ($score > $best_score) { $bests = array('Words' => "$n_words * 5 = " . ($n_words * 5), 'Connectors' => "$n_connectors * 3 = " . ($n_connectors * 3), 'Filled in spaces' => $n_filleds ); $best_score = $score; $best_puzzle = $puzzle; } if (time() - $t1 > $time_limit - 2) break; } echo "\n<table border=0 cellpadding=10>\n<tr>\n<td>"; echo disp_puzzle($best_puzzle); echo "\n</td>\n<td align=right>"; foreach($bests as $field => $value) { echo "\n$field: <b>$value</b><br>"; } echo "\nTotal score: <b>$best_score</b><br>"; echo "\n<br><br>Elapsed time: <b>" . (time() - $t1) . " seconds</b>"; echo " </td> </tr> </table> </body> </html>"; function disp_puzzle($puzzle) { $ret = "\n<table border=0 cellpadding=2 cellspacing=1>\n<tr>"; for ($n = 0;; $n ++) { if (($m = $n % N22) == 0 or $m == N21 or $n < N22 or $n > N2200) { $ret .= "\n<td class=marc>&nbsp;&nbsp;</td>"; } elseif ($puzzle[$n] == '0') { $ret .= "\n<td class=limit>&nbsp;</td>"; } elseif ($puzzle[$n] == '.') { $ret .= "\n<td class=blanc>&nbsp;</td>"; } else { if (($puzzle[$n - 1] > '0' or $puzzle[$n + 1] > '0') and ($puzzle[$n - N22] > '0' or $puzzle[$n + N22] > '0')) { $ret .= "\n<td align=center class=connector>$puzzle[$n]</td>"; } else { $ret .= "\n<td align=center class=filled>$puzzle[$n]</td>"; } } if ($n == N2221) { return "$ret\n</tr>\n</table>"; } elseif ($m == N21) { $ret .= "\n</tr>\n<tr>"; } } return "$ret\n</tr>\n</table>"; } function scan_pos($pos, $dir, $val_blanc) { if ($dir == 'h') { $inc = 1; if ($pos + $inc >= N2222) return false; $oinc = N22; $new_dir = 'v'; } else { $inc = N22; if ($pos + $inc >= N2222) return false; $oinc = 1; $new_dir = 'h'; } global $puzzle; if ($puzzle[$pos] < 'a' and (! $val_blanc)) return false; if (($puzzle[$pos - $inc] > '0') or ($puzzle[$pos + $inc] > '0')) { return false; } global $words; global $magics; global $poss; $regex = $puzzle[$pos]; $left = $right = 0; for ($limit_a = $pos - $inc; ($w = $puzzle[$limit_a]) !== '0'; $limit_a -= $inc) { if ($puzzle[$limit_a] == '.' and (($puzzle[$limit_a - $oinc] > '0') or ($puzzle[$limit_a + $oinc] > '0'))) { break; } if (++$left == MAXW) { $left --; break; } $regex = $w . $regex; } for ($limit_b = $pos + $inc; ($w = $puzzle[$limit_b]) !== '0'; $limit_b += $inc) { if ($puzzle[$limit_b] == '.' and (($puzzle[$limit_b - $oinc] > '0') or ($puzzle[$limit_b + $oinc] > '0'))) { break; } if (++$right == MAXW) { $right--; break; } $regex .= $w; } if (($len_regex = strlen($regex)) < 2) return false; foreach ($magics[$len_regex] as $m => $lens) { $ini = max(0, ($left + 1) - $lens); $fin = $left; $pos_p = max($limit_a + $inc, $pos - (($lens - 1 ) * $inc)); for($pos_c = $ini; $pos_c <= $fin; $pos_c++, $pos_p += $inc) { if ($puzzle[$pos_p - $inc] > '0') continue; $r = '/;' . str_replace('.', '\w', substr($regex, $pos_c, $lens)) . ';/'; if (! preg_match($r, $words, $arr)) continue; $larr0 = $pos_p + ((strlen($arr[0]) - 2) * $inc); if ($larr0 >= N2222) continue; if ($puzzle[$larr0] > '0') continue; $words = str_replace("$arr[0]", ';', $words); for ($n = 1, $pp = $pos_p; $n < strlen($arr[0]) - 1; $n++, $pp += $inc) { $puzzle[$pp] = $arr[0][$n]; if ($pp == $pos) continue; $poss[] = array($pp, $new_dir, ord($puzzle[$pp])); } $puzzle[$pos_p - $inc] = '0'; $puzzle[$pp] = '0'; return true; } } return false; } ?><? function cmp($a, $b) { return strlen($b) - strlen($a); } function cmp_magic($a, $b) { return (strlen($a) + mt_rand(0, 3)) - (strlen($b) - mt_rand(0, 1)); } ?>
This is a winner from the PHP Coding Contest at Codewalkers.com. It automatically plays the game of down and out. ftp://ftp.codewalkers.com/dno/8/
This is the winner of the Codewalkers.com coding contest. The challenge was the find the shortest path out of a maze in the shortest time. This code makes use of the GD library to present the path out of the maze. <?php /**************************************************************************** ***** ***** ***** MAZE CONTEST ***** ***** NAME: SCOTT A SOLOMKO ***** ***** ***** ***** ***** ****************************************************************************/ function InitialLoad(){ echo " <html> <head> <title>Scott Solomko :: Maze Contest</title> </head> <body bgcolor=\"#ffffff\"> <center> <form method=post action=\"contestwinner.php?action=2\" enctype=\"multipart/form-data\"> <input type=hidden name=\"MAX_FILE_SIZE\" value=\"8192\"> <table width=75% cellpadding=0 cellspacing=0 border=1> <tr> <td align=right>Upload file containing maze:</td> <td><input type=\"file\" size=20 name=\"iFile\"></td> </tr> <tr> <td align=right>Select the type of output:</td> <td> <input type=radio value=1 name=output>PNG File <input type=radio value=2 name=output>HTML Table <input type=radio value=3 name=output>Text File </td> </tr> <tr> <td align=center colspan=2><input type=submit></td> </tr> </table> </form> </center> </body> </html>"; } function FindRoute($iFile, $output){ $row = 0; $col = 0; $c_count = 1; $fp = fopen($iFile, "r"); // fill the 2d array while (!feof($fp)){ $ch = fgetc($fp); if (!feof($fp)){ if ($ch == "W"){ $maze[$row][$col] = $ch; $col++; } else if ($ch == " "){ $maze[$row][$col] = -1; $col++; } else if ($ch == "\n"){ $row++; $col = 0; } else if ($ch == "S" || $ch == "E"){ $maze[$row][$col] = $ch; if ($ch == "S"){ $s_row = $row; $s_col = $col; } else { $e_row = $row; $e_col = $col; } $col++; } } } fclose($fp); // define boundries $b_right = sizeof($maze[0]); $b_bottom = sizeof($maze); // start algorithm from 'E'. this will mark only one 'space' and record // its coordinates, which 'space' is determined by which side 'E' is // located. No need to check for 'E' in a corner. if ($e_col == sizeof($maze[0]) - 1){ $maze[$e_row][$e_col - 1] = $c_count; $c_count++; $tmp_row = array($e_row); $tmp_col = array($e_col - 1); } else if ($e_col == 0){ $maze[$e_row][$e_col + 1] = $c_count; $c_count++; $tmp_row = array($e_row); $tmp_col = array($e_col + 1); } else if ($e_row == sizeof($maze) - 1){ $maze[$e_row - 1][$e_col] = $c_count; $c_count++; $tmp_row = array($e_row - 1); $tmp_col = array($e_col); } else { $maze[$e_row + 1][$e_col] = $c_count; $c_count++; $tmp_row = array($e_row + 1); $tmp_col = array($e_col); } // goto the coordinate(s) that have been marked and mark its adjacent // 'spaces' if applicable (check for -1). while (sizeof($tmp_row) != 0){ $orig_size = sizeof($tmp_row); for ($i = 0; $i < $orig_size; $i++){ // ckeck up if ($tmp_row[0] - 1 > 0){ if ($maze[$tmp_row[0] - 1][$tmp_col[0]] == -1){ $maze[$tmp_row[0] - 1][$tmp_col[0]] = $c_count; array_push($tmp_row, $tmp_row[0] - 1); array_push($tmp_col, $tmp_col[0]); } else if ($maze[$tmp_row[0] - 1][$tmp_col[0]] == "S"){ break 2; } } // check down if ($tmp_row[0] + 1 < $b_bottom - 1){ if ($maze[$tmp_row[0] + 1][$tmp_col[0]] == -1){ $maze[$tmp_row[0] + 1][$tmp_col[0]] = $c_count; array_push($tmp_row, $tmp_row[0] + 1); array_push($tmp_col, $tmp_col[0]); } else if ($maze[$tmp_row[0] + 1][$tmp_col[0]] == "S"){ break 2; } } // check left if ($tmp_col[0] - 1 > 0){ if ($maze[$tmp_row[0]][$tmp_col[0] - 1] == -1){ $maze[$tmp_row[0]][$tmp_col[0] - 1] = $c_count; array_push($tmp_row, $tmp_row[0]); array_push($tmp_col, $tmp_col[0] - 1); } else if ($maze[$tmp_row[0]][$tmp_col[0] - 1] == "S"){ break 2; } } // check right if ($tmp_col[0] + 1 < $b_right - 1){ if ($maze[$tmp_row[0]][$tmp_col[0] + 1] == -1){ $maze[$tmp_row[0]][$tmp_col[0] + 1] = $c_count; array_push($tmp_row, $tmp_row[0]); array_push($tmp_col, $tmp_col[0] + 1); } else if ($maze[$tmp_row[0]][$tmp_col[0] + 1] == "S"){ break 2; } } array_shift($tmp_row); array_shift($tmp_col); } $c_count++; } echo "<html> <head> <title>Scott Solomko :: Maze Contest</title> </head> <body bgcolor=\"#ffffff\"> The shortest path possible is ".$c_count." steps including 'E'.<p>\n"; // map out shortest path with 'P' if ($maze[$s_row - 1][$s_col] == $c_count - 1){ $maze[$s_row - 1][$s_col] = "P"; $t_row = $s_row - 1; $t_col = $s_col; $c_count--; } else if ($maze[$s_row + 1][$s_col] == $c_count - 1){ $maze[$s_row + 1][$s_col] = "P"; $t_row = $s_row + 1; $t_col = $s_col; $c_count--; } else if ($maze[$s_row][$s_col - 1] == $c_count - 1){ $maze[$s_row][$s_col - 1] = "P"; $t_row = $s_row; $t_col = $s_col - 1; $c_count--; } else { $maze[$s_row][$s_col + 1] = "P"; $t_row = $s_row; $t_col = $s_col + 1; $c_count--; } for ($i = 1; $i < $c_count; $i++){ if ($maze[$t_row - 1][$t_col] == $c_count - $i){ $t_row--; $maze[$t_row][$t_col] = "P"; } else if ($maze[$t_row + 1][$t_col] == $c_count - $i){ $t_row++; $maze[$t_row][$t_col] = "P"; } else if ($maze[$t_row][$t_col - 1] == $c_count - $i){ $t_col--; $maze[$t_row][$t_col] = "P"; } else { $t_col++; $maze[$t_row][$t_col] = "P"; } } // prep 2d array for output, clear all remaining numbers for ($i = 0; $i < $b_bottom; $i++){ for($j = 0; $j < $b_right; $j++){ if ($maze[$i][$j] != "W" && $maze[$i][$j] != "P" && $maze[$i][$j] != "S" && $maze[$i][$j] != "E"){ $maze[$i][$j] = " "; } } } // call appropriate output function switch($output){ case 1: OutputPNG($maze, $b_bottom, $b_right); break; case 2: OutputHTML($maze, $b_bottom, $b_right); break; case 3: OutputTXT($maze, $b_bottom, $b_right); break; } } function OutputPNG(&$maze, &$b_bottom, &$b_right){ $width = $b_right * 10; $height = $b_bottom * 10; $img = imagecreate($width + 10, $height + 10); $bg = imagecolorallocate($img, 0xFF, 0xFF, 0xFF); $border = imagecolorallocate($img, 0x00, 0x00, 0x00); $wall = imagecolorallocate($img, 0xB2, 0x22, 0x22); $path = imagecolorallocate($img, 0x00, 0x00, 0x99); imagerectangle($img, 0, 0, $width, $height, $border); for($i = 10; $i <= $width; $i += 10){ imageline($img, $i, 0, $i, $height, $border); } for($i = 0; $i <= $height; $i += 10){ imageline($img, 0, $i, $width, $i, $border); } for($i = 0; $i < $b_bottom; $i++){ for($j = 0; $j < $b_right; $j++){ if ($maze[$i][$j] == "W"){ imagefilltoborder($img, $j * 10 + 5, $i * 10 + 5, $border, $wall); } else if ($maze[$i][$j] == "P" || $maze[$i][$j] == "S" || $maze[$i][$j] == "E"){ imagefilltoborder($img, $j * 10 + 5, $i * 10 + 5, $border, $path); } } } imagepng($img, "scottsolomko.png"); imagedestroy($img); echo "<img src=\"scottsolomko.png\" border=0></body></html>"; } function OutputHTML(&$maze, &$b_bottom, &$b_right){ echo "<table width=50% cellpadding=0 cellspacing=0 border=1>"; for ($i = 0; $i < $b_bottom; $i++){ echo "<tr>"; for($j = 0; $j < $b_right; $j++){ if ($maze[$i][$j] == "W"){ echo "<td bgcolor=\"#b22222\"><font color=\"#b22222\">W</font></td>"; } else if ($maze[$i][$j] == " "){ echo "<td bgcolor=\"#ffffff\">&nbsp;</td>"; } else { echo "<td bgcolor=\"#000099\">&nbsp;</td>"; } } echo "</tr>\n"; } echo "</table></body></html>"; } function OutputTXT(&$maze, &$b_bottom, &$b_right){ $fp = fopen("scottsolomko.txt", "w"); for ($i = 0; $i < $b_bottom; $i++){ for($j = 0; $j < $b_right; $j++){ fputs($fp, $maze[$i][$j]); } fputs($fp, "\n"); } fclose($fp); echo "To view the text file that was created click <a href=\"scottsolomko.txt\">here</a></body></html>."; } if (empty($HTTP_GET_VARS["action"])){ $action = 1; } else { $action = $HTTP_GET_VARS["action"]; } switch($action){ case 1: InitialLoad(); break; case 2: FindRoute($HTTP_POST_FILES["iFile"]["tmp_name"],$HTTP_POST_VARS["output"]); break; default: echo "The page you requested does not exist."; break; } ?>
This is the winning code from the 'Flipping Shuffles' contest at www.php-editors.com <?php /* * cards.php * www.php-editors.com contest - 7th April 2003 * +-----------------------------------+ * | Author: cagrET (Cezary Tomczak) | * | Email: cagret@yahoo.com | * | Homepage: http://cagret.prv.pl | * | Country: Poland | * +-----------------------------------+ */ error_reporting(E_ALL); //set_time_limit(60); //set_error_handler('my_error_handler'); new Cards; class Cards { var $filename = 'deck.txt'; var $cards; // min: 2 , max: 52 , even number: 2,4,6 ... 50,52 var $perfect; // cards in perfect position var $cards_op = array(); //operations (CSF) var $cards_op_id; //current id var $cards_op_tmp = array(); //temporary var $cards_tmp; //last shuffle done var $decks = array(); //combinations of decks var $len; // length var $half; // 1/2 length var $maxshuffle; var $CutFlip; //cut flip combinations var $Shuffle; //shuffle combinations var $time; function Cards() { //init $this->cards = $this->read($this->filename); $this->len = strlen($this->cards); $this->half = $this->len / 2; $this->perfect = $this->getPerfect($this->half); $this->maxshuffle = $this->getMaxShuffle($this->half); //starting //$this->time_start(); $this->init(); } function init() { //print $this->operate_undo('12C23FC1C', 1); //return; //print $this->operate('F1C1C1C1C1C', 1); //return; //cutflip and shuffle arrays $this->CutFlip = $this->getCutFlip(); $this->Shuffle = $this->getShuffle(); $this->decks = $this->CutFlip; //creating deck of combinations $this->try1st(); //try 1st combinations of C , F , CF $this->CutFlip = $this->getCutFlip2(); $even = false; while (true) { if ($even) { $this->tryCutFlip(); $even = false; } else { $this->tryShuffle(); $even = true; } } } //1st operate function try1st() { foreach($this->decks as $val) { $this->operate($val); } } //joins deck with parts of CutFlip array function tryCutFlip() { $tmp_decks = $this->decks; $this->decks = array(); $this->cards_op_tmp = $this->cards_op; $this->cards_op = array(); foreach($tmp_decks as $key => $val) { foreach ($this->CutFlip as $val2) { $this->cards_op_id = $key; $this->operate_fast($val2, $val); $this->decks[] = $val . $val2; } } } //joins deck with parts of Shuffle array function tryShuffle() { $tmp_decks = $this->decks; $this->decks = array(); $this->cards_op_tmp = $this->cards_op; $this->cards_op = array(); foreach($tmp_decks as $key => $val) { foreach($this->Shuffle as $val2) { $this->cards_op_id = $key; $this->operate_fast($val2, $val); $this->decks[] = $val . $val2; } } } function getCutFlip() { return array('', 'F', 'C', 'CF'); } //there is no sense in repeating 'F' or 'CF' function getCutFlip2() { return array('C'); } function getShuffle() { $len = $this->maxshuffle; $Shuffle = array(); for($i = 1; $i <= $len; ++$i) { $Shuffle[] = $i; } return $Shuffle; } //this is faster cause it adds 1 operation instead of doing all ... (in table is string from similar operation) //$s - last operation, $s_start - all prevoious ; F1C3C4 ($s_start) 3($s) function operate_fast($s, $s_start) { $tmp = $this->cards_op_tmp[$this->cards_op_id]; switch ($s) { case 'C': //CUT $tmp = substr($tmp, -$this->half) . substr($tmp, 0, $this->half); break; case 'F': //FLIP $tmp = strrev($tmp); break; default: //SHUFFLE if ($s == 1) { $tmp = $this->shuffle($tmp); $this->cards_tmp = $tmp; } else { $tmp = $this->cards_tmp = $this->shuffle($this->cards_tmp); } break; } //caching results - average 12x times faster with caching $this->cards_op[] = $tmp; if ($tmp == $this->perfect) { $this->finish($s_start . $s); } } //operates on $s = FSS etc. function operate($s, $return = false) { $tmp = $this->cards; $len = strlen($s); for($i = 0; $i < $len; ++$i) { $index = $s{$i}; if (is_numeric($index) && $i < $len-1 && is_numeric($s{$i + 1})) { $index .= $s{++$i}; } switch ($index) { case 'C': //CUT $tmp = substr($tmp, -$this->half) . substr($tmp, 0, $this->half); break; case 'F': //FLIP $tmp = strrev($tmp); break; default: //SHUFFLE x times //if ($this->count == 12) trigger_error('', E_USER_ERROR); $tmp = $this->shuffle_x($tmp, $index); break; } } if ($return) { return $tmp; } else { //operate_fast compatible $this->cards_op[] = $tmp; if ($tmp == $this->perfect) { $this->finish($s); } } } //FOUND function finish($s) { $s = $this->undo_deck($s); print $s . strlen($s); //print '<br /><br />' . $this->time_end(); exit; } //translate from our system - change F4C3 to FSSSSCSSS etc. function undo_deck($s) { $len = strlen($s); $tmp = ''; for ($i = 0; $i < $len; ++$i) { if (is_numeric($index = $s{$i})) { if ($i < $len-1 && is_numeric($s{$i + 1})) { $index .= $s{++$i}; } $tmp .= str_repeat('S', $index); } else { $tmp .= $s{$i}; } } return $tmp; } // CUT == undo cut x1 function cut($s) { return substr($s, -$this->half) . substr($s, 0, $this->half); } // SHUFFLE single string (SLOW) function shuffle($s) { $tmp = ''; $b = $this->half; for ($i = 0; $i < $this->half; ++$i) { $tmp .= $s{$b++} . $s{$i}; } return $tmp; } // SHUFFLE x times (SLOW) function shuffle_x($s, $x) { $tmp2 = $s; for ($i = 1; $i <= $x; ++$i) { $tmp = ''; $a = 0; $b = $this->half; for ($ii = 0; $ii < $this->half; ++$ii) { $tmp .= $tmp2{$b++} . $tmp2{$a++}; } $tmp2 = $tmp; } return $tmp2; } // SHUFFLE UNDO (SLOW) function shuffle_undo($s) { $a = ''; $b = ''; for ($x = 0; $x < $this->len; $x += 2) { $b .= $s{$x}; $a .= $s{$x + 1}; } return $a . $b; } // FLIP == undo flip x1 function flip($s) { return strrev($s); } // GET PERFECT string ; $deck = $this->half function getPerfect($deck) { $upper = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'; $lower = 'abcdefghijklmnopqrstuvwxyz'; return substr($upper, 0, $deck) . substr($lower, 0, $deck); } // number of shuffles after which string repeats OR is reversed (flip) function getMaxShuffle($deck) { switch ($deck) { case 1: return 1;//should 0 but must 1 :-) case 2: return 1;//3 case 3: return 2; case 4: return 2;//5 case 5: return 4;//9 case 6: return 5;//11 case 7: return 3; case 8: return 3;//7 case 9: return 8;//17 case 10: return 5; case 11: return 10; case 12: return 9;//19 case 13: return 8;//17 case 14: return 13;//27 case 15: return 4; case 16: return 4;//9 case 17: return 11; case 18: return 17;//35 case 19: return 11; case 20: return 9;//19 case 21: return 6;//13 case 22: return 11; case 23: return 22; case 24: return 20; case 25: return 7; case 26: return 25;//51 } } // READ string from file (and trim) function read($filename) { $fp = fopen($filename, 'r', 0) or exit('couldnt open file'); $data = trim(fread($fp, filesize($filename))); fclose($fp); return $data; } //FOR TESTING - undo operations //this is used to create decks that have a solution 100% function operate_undo($s) { $tmp = $this->cards; //reverse cause undo $s = strrev($s); $len = strlen($s); for ($i = 0; $i < $len; $i++) { $index = $s{$i}; if (is_numeric($index) && $i < $len-1 && is_numeric($s{$i + 1})) { $index .= $s{++$i}; } switch ($s{$i}) { case 'C': //CUT (cut = undo cut) $tmp = $this->cut($tmp); break; case 'F': //FLIP (flip = undo flip) $tmp = $this->flip($tmp); break; default: //UNDO SHUFFLE x times for($ii = 1; $ii <= $index; ++$ii) { $tmp = $this->shuffle_undo($tmp); } break; } } return $tmp; } // initializing TIME function time_start() { $this->time = $this->get_microtime(); } // return elapsed TIME - must call time_start() before function time_end() { return ($this->get_microtime() - $this->time); } // get microtime function get_microtime() { $mtime = explode(" ", microtime()); return (double)($mtime[1]) + (double)($mtime[0]); } // human readable variable function print_r($var) { echo '<pre>'; print_r($var); echo '</pre>'; exit(); } } // ERROR HANDLER - give additional informations about variables // in actual SCOPE function my_error_handler($errno, $errmsg, $file, $line, $vars) { //limit of 5 errors static $count; if (!isset($count)) { $count = 0; } $count++; if ($count > 5) { exit; } echo '<pre>'; echo "<b>Error:</b> $errmsg \n"; echo "<b>Line:</b> $line\n\n"; print_r($vars); echo '</pre>'; //when called like this => trigger_error('my error', E_USER_ERROR); if ($errno == E_USER_ERROR) { exit(); } } ?>
Given a deck of cards via a text file, this script will deal and play a game of freecell. ftp://codewalkers.com/freecell/winner/freecell_Tomas_Kaulakys.zip
Get gamate game news on your page. Gamate is a repository for game extensions. <? $display_items = 10; if($fd = @fopen("http://www.gamate.com/output/$display_items/", "r")) { while ($buffer = fgets($fd, 4096)) { list($name,$link) = explode(";",$buffer); print "<a href=\"$link\">$name</a><br>"; } fclose($fd); } ?>
Type in a message, it disappears. You make it re-appear by dragging a graphic over the message. Great fun for kids. <!-- This script is simple to install. Just skip past the advertising code below for details --> <center><!-- BEGIN RICH-MEDIA BURST! CODE --> <script language="JavaScript"> <!-- /* 1997-1999 BURST! Media, LLC. All Rights Reserved.*/ var TheAdcode = 'ad6406a'; var bN = navigator.appName; var bV = parseInt(navigator.appVersion); var base='http://www.burstnet.com/'; var Tv=''; var agt=navigator.userAgent.toLowerCase(); if (bV>=4) {ts=window.location.pathname+window.location.search; i=0; Tv=0; while (i< ts.length) { Tv=Tv+ts.charCodeAt(i); i=i+1; } Tv="/"+Tv;} else {Tv=escape(window.location.pathname); if( Tv.charAt(0)!='/' ) Tv="/"+Tv; else if (Tv.charAt(1)=="/")Tv=""; if( Tv.charAt(Tv.length-1) == "/") Tv = Tv + "_";} if (bN=='Netscape'){ if ((bV>=4)&&(agt.indexOf("mac")==-1)) { document.write('<s'+'cript src="'+ base+'cgi-bin/ads/'+TheAdcode+'.cgi/RETURN-CODE/JS' +Tv+'">'); document.write('</'+'script>'); } else if (bV>=3) {document.write('<'+'a href="'+base+'ads/'+ TheAdcode+'-map.cgi'+Tv+'"target=_top>'); document.write('<img src="' + base + 'cgi-bin/ads/' + TheAdcode + '.cgi' + Tv + '" ismap width="468" height="60"' + ' border="0" alt="Click Here"></a>');} } if (bN=='Microsoft Internet Explorer') document.write('<ifr'+'ame id="BURST" src="'+base+'cgi-bin/ads/'+ TheAdcode + '.cgi' + Tv + '/RETURN-CODE" width="468" height="60"' + 'marginwidth="0" marginheight="0" hspace="0" vspace="0" ' + 'frameborder="0" scrolling="no"></ifr'+'ame>'); // --> </script> <noscript><a href="http://www.burstnet.com/ads/ad6406a-map.cgi" target="_top"> <img src="http://www.burstnet.com/cgi-bin/ads/ad6406a.cgi" width="468" height="60" border="0" alt="Click Here"></a> </noscript> <!-- END BURST CODE --></center> <!-- You can also skip the next paragraph in copying this code. --> <BR> <center> <font size=4 face="arial, helvetica" color=#000000>View the source code for this page and follow the directions. Afterwards, type in a message below and press the button. Then follow the directions on the new page you will see.</font></center> <!-- Here's the general code for this page. A link to The PHP Loft should be included. Just copy the code below. Then proceed to phpinvi.php and view the source code there. --> <BR> <center> <font size=2><I>(Please note: this page won't work on Netscape.)</I></font></center> <BR> <center> <font size=6 face="arial, helvetica" color=#FF0000>Create an Invisible Message!</font></center> <center> <font size=5 face="arial, helvetica" color=#4b0082> Type in your secret message below...</font></center> <form action="phpinvi.php" method="post"> <font size=3 face="arial, helvetica" color=#ff0000> <B>Your Message:</B></font> <input type="text" name="message"><BR><BR> <input type="submit" value="Make Invisible!"> </form> <font size=3 face="arial, helvetica"><B><a href="http://thephploft.com">Provided by The PHP Loft</a></B></font> </BODY></HTML>
This is the contests winning code from www.php-editors.com PHP Programming Contest June 2003 <?php /** * words.php - php-editors.com [Jumbled Words B3] contest (may/june 2003) * +-----------------------------------+ * | Author: cagrET (Cezary Tomczak) | * | Email: cagret@yahoo.com | * | Homepage: http://cagret.prv.pl | * | Country: Poland | * +-----------------------------------+ * All rights reserved, 2003. */ set_time_limit(300); error_reporting(E_ALL); /** * --------------------- * Preparing environment * --------------------- */ define('LETTERS', 'abcdefghijklmnopqrstuvwxyz'); define('WORD_MAX_LENGTH', 20); define('LINE_MAX_LENGTH', 80); define('WORD_SEPERATOR', ' '); define('LIST_SEPERATOR', ','); define('SENTENCE_SEPERATOR', '.'); define('CRLF_PATTERN', "/(\r\n|\n|\r)/"); define('BLANKS_MAX', 2); define('BLANK_START', '<span style="color: red;">'); define('BLANK_END', '</span>'); define('BLANK_LINE', "<br />\n"); define('FILE_LISTS', 'lists.txt'); /** * -------------------- * Initializing objects * -------------------- */ /** * Managing letters * @package Words */ class Letters { /** * Letters pattern * @var array * @access private */ var $pattern = array( 'a' => 0, 'b' => 0, 'c' => 0, 'd' => 0, 'e' => 0, 'f' => 0, 'g' => 0, 'h' => 0, 'i' => 0, 'j' => 0, 'k' => 0, 'l' => 0, 'm' => 0, 'n' => 0, 'o' => 0, 'p' => 0, 'q' => 0, 'r' => 0, 's' => 0, 't' => 0, 'u' => 0, 'v' => 0, 'w' => 0, 'x' => 0, 'y' => 0, 'z' => 0 ); /** * Available letters * @var array * @access private */ var $letters; /** * Blanks leters - max 2 can be used * @var array * @access private */ var $blanks = array(); /** * Constructor */ function Letters() { $this->letters = $this->pattern; } /** * Add given letter * * @param string $s * @return void * @access private */ function add($s) { if (isset($this->blanks[$s])) { unset($this->blanks[$s]); } else { ++$this->letters[$s]; } } /** * Add letters from given word * * @param string $word * @return void * @access public */ function addWord($word) { for ($i = 0, $len = strlen($word); $i < $len; ++$i) { $this->add($word{$i}); } } /** * Remove given letter * * @param string $s * @return void * @access private */ function remove($s) { if ($this->letters[$s] > 0) { --$this->letters[$s]; } else { $this->blanks[$s] = 1; } } /** * Remove letters that are in given word * * @param string $word * @return void * @access public */ function removeWord($word) { for ($i = 0, $len = strlen($word); $i < $len; ++$i) { $this->remove($word{$i}); } } /** * Check whether there are available $i given letters * * @param string $s letter * @param int $i how many such letters * @param int $blanks blank letters already used * @return bool * @access private */ function exists($s, $i, &$blanks) { if ($i == 1) { if ($this->letters[$s] > ($i - 1)) { return true; } if ((count($blanks) < BLANKS_MAX) && !isset($blanks[$s])) { array_push($blanks, $s); return true; } } else { if ($this->letters[$s] > ($i - 1)) { return true; } if ( ($this->letters[$s] > ($i - 2)) && ((count($blanks) < BLANKS_MAX) && !isset($blanks[$s])) ) { array_push($blanks, $s); return true; } } return false; } /** * Check whether there are available letters to create given word * * @param string $word * @return bool * @access public */ function existsWord($word) { $blanks = $this->blanks; $letters = $this->pattern; for ($i = 0, $len = strlen($word); $i < $len; ++$i) { ++$letters[$word{$i}]; } foreach ($letters as $letter => $repeat) { if ($repeat > 0 && !$this->exists($letter, $repeat, $blanks)) { return false; } } return true; } /** * Get blank letters that were used * * @return array with letters as values * @access public */ function getBlanks() { return array_keys($this->blanks); } /** * Count characters * * @param array $words * @return int * @access public * @static */ function count($words) { $count = 0; foreach ($words as $word) { $count += strlen($word); } return $count; } } /** * Managing lists - searching words * @package Words */ class Words_List { /** * Input words * @var array * @access private */ var $words; /** * Available letters, from sentence * @var object * @access private */ var $Letters; /** * Current words (values as position) * @var array * @access private */ var $current = array(); /** * Current position * @var int * @access private */ var $position = -1; /** * Constructor * * @param array $words * @param object $Letters */ function Words_List($words, &$Letters) { $this->words =& $words; $this->Letters =& $Letters; } /** * Walk through combinations of words * * @return bool if more combinations exists * @access public */ function next($check = true) { if (isset($this->words[$this->position + 1])) { $word = $this->words[++$this->position]; if ($this->Letters->existsWord($word)) { $this->Letters->removeWord($word); array_push($this->current, $this->position); return true; } else { return $this->next(); } } else { $count = count($this->current); if (($count == 0) || ($count == 1 && ($this->current[0] == $this->position) )) { return false; } $this->position = array_pop($this->current); $this->Letters->addWord($this->words[$this->position]); return $this->next(); } } /** * Return current list of words * * @return array * @access public */ function getCurrent() { $ret = array(); foreach ($this->current as $v) { array_push($ret, $this->words[$v]); } return $ret; } } /** * --------- * Functions * --------- */ function compare($a, $b) { $l1 = strlen($a); $l2 = strlen($b); if ($l1 == $l2) { return 0; } return $l1 < $l2 ? +1 : -1; } /** * ---------- * Controller * ---------- */ //init vars $result = array(); //array of array of words $result_blanks = array(); //array of array of blank letters used to create words //read data $fp = @fopen(FILE_LISTS, 'r') or exit('Could not open file: ' . FILE_LISTS); $content = trim(fread($fp, filesize(FILE_LISTS))); fclose($fp); //remove new lines $content = preg_replace(CRLF_PATTERN, '', $content); $content = explode(SENTENCE_SEPERATOR, $content); array_pop($content); //search foreach ($content as $v) { list($list, $sentence) = explode(LIST_SEPERATOR, $v); $words = explode(WORD_SEPERATOR, $list); if ($words[count($words) - 1] == WORD_SEPERATOR) { array_pop($words); } $sentence = str_replace(WORD_SEPERATOR, '', $sentence); //add letters from sentence $Letters =& new Letters; $Letters->addWord($sentence); //remove words that cannot be ever built $copy = $words; foreach ($copy as $k => $word) { if (!$Letters->existsWord($word)) { unset($copy[$k]); } } $words = array(); foreach ($copy as $word) { array_push($words, $word); } $List =& new Words_List($words, $Letters); $best_list = array(); $best_list_len = 0; $best_list_blanks = array(); //search all combinations while ($List->next()) { $current = $List->getCurrent(); if (($count = Letters::count($current)) > $best_list_len) { $best_list = $current; $best_list_len = $count; $best_list_blanks = $Letters->getBlanks(); } } //save best result $result[] = $best_list; $result_blanks[] = $best_list_blanks; } //output data $total = 0; foreach ($result as $k => $words) { $total += Letters::count($words); usort($words, 'compare'); $words = implode(WORD_SEPERATOR, $words); $words_output = $words; $blanks = $result_blanks[$k]; //colorize blanks if ($blanks > 0) { $words_output = ''; for ($i = 0, $len = strlen($words); $i < $len; ++$i) { $letter = $words{$i}; if (in_array($letter, $blanks)) { foreach ($blanks as $k2 => $blank) { if ($letter == $blank) { $letter = BLANK_START . $letter . BLANK_END; unset($blanks[$k2]); } } } $words_output .= $letter; } } print $words_output . BLANK_LINE; } print $total; ?>
This is a winner of the Codewalkers.com PHP coding contest. This script automatically plays a game of klondike. For more information on this script and to see it in action goto http://codewalkers.com/php-contest <?php /* Written by Laurent as a submission to codewalker php contest #4 I can be reached at <removed> goal is to write a script that would make best score / execute faster / displays each plays nicely (in this order of importance) at klondike solitaire game See http://codewalkers.com/php-contest.php usage : card.php -> will use default deck and default graphic mode card.php?stock=deck -> will use "deck.txt" (note the added extension) and default graphic mode card.php?stock=deck&graphic=on -> will use deck.txt and graphic mode card.php?stock=deck&graphic=off -> will use deck.txt and text mode timer is started just before starting the algo and right before displaying the result temporary storage of each try's results and display is made through php's output_buffering (ob_xxx functions) */ define('PATH_TO_IMAGES','./'); define('DEFAULT_STOCK_FILE','deck.txt'); define('DEFAULT_GRAPHIC','true'); ob_start(); //error_reporting(E_ALL); if (isset($stock)) $stockfilename=$stock.'.txt'; else $stockfilename=DEFAULT_STOCK_FILE; if (isset($graphic) && ($graphic=='on')) $graphic=true; else if (isset($graphic) && ($graphic=='off')) $graphic=false; else $graphic=DEFAULT_GRAPHIC; srand((double)microtime()*1000000); function getmicrotime(){ list($usec, $sec) = explode(" ",microtime()); return ((float)$usec + (float)$sec); } $order = array('1'=>0,'2'=>1,'3'=>2,'4'=>3,'5'=>4,'6'=>5,'7'=>6,'8'=>7,'9'=>8,'10'=>9,'J'=>10,'Q'=>11,'K'=>12); $reverse_order = array_keys($order); function Message($string) { echo('<center><table border=1 width="100%"><tr><td align="center" bgcolor="#C0C0C0">'.$string.'</td></tr></table></center>'."\n"); } class card { var $kind; //HSDC var $color; //RB var $pos; //0..12 var $symbol; var $name; var $visible; var $moveable; function card($c) { global $order; $this->name=$c; $val = substr($c,0,strlen($c)-1); $this->symbol=$val; $this->pos=$order[$val]; $this->kind = substr($c,-1); if ($this->kind=='H' || $this->kind=='D') $this->color='R'; else $this->color='B'; $this->visible=false; } function set_visible($yes) { $this->visible=$yes; } function is_visible() {return $this->visible;} function name() {return $this->name;} //Colored name function c_name() { return ( ($this->color=='R'?'<font color="red">':''). $this->name. ($this->color=='R'?'</font>':'') ); } function color() {return $this->color;} function val() {return $this->pos;} function kind() {return $this->kind;} function symbol() {return $this->symbol;} } //Class responsible for the stock/talon management class stock{ var $stock = array(); //Main stock of cards var $talon = array(); //returned cards var $turn = 0; //Will count how many times we played 3 cards //Initialize the class by loading the deck from file function stock($filename='deck1.txt') { if (file_exists($filename)) { $this->stock = file($filename); foreach($this->stock as $id=>$val) if (trim($val) != '') $this->stock[$id]=new card(strtoupper(trim($val))); } else return false; $this->turn=0; //Initialize turn counter //shuffle ($this->stock); uncomment this line if you want to play with random (shuffled) stock } //Play $skip cards and return the next card from the stock //(that is every one out of $skip or the last one if less than $skip remaining) //Return the card if stock is not empty, 'empty string' if there are no more cards in the stock function GetCard($skip='3') { if (count($this->stock)==0) return ''; //No more card left in stock if (count($this->stock) < $skip) $skip = count($this->stock); for($i=0;$i<$skip;$i++) { $card = array_shift($this->stock); array_unshift($this->talon,$card); } $this->turn++; return $card; } //Uses the current available card, that is remove it from talon function UseCard() { return array_shift($this->talon); } //will return the current available card from the talon or 'empty string' if talon is empty function CurrentCard() { if (count($this->talon) == 0) return ''; return reset($this->talon); } //Reset the stock to the remaining cards after it has been emptied //Return number of cards in stock (0 probably means we won) function DrawOver() { $this->stock = array_reverse($this->talon); //turn talon over to stock $this->talon=array(); //Empties talon return count($this->stock); //return number of cards in stock } } //End class stock //Class responsible for the management of a column in the tableau class column { var $cards = array(); //Arrays of cards in this column //Initialize the column to an empty one function column () { $this->cards=array(); } //Append a card (or an array of cards) down to a colum. function append ($c) { //$c can be a single card or an array of cards if (is_array($c)) foreach($c as $card) array_push($this->cards, $card); else array_push($this->cards, $c); } //Remove cards from a column, start at position $pos in the column function remove($pos) { $cards = array_splice($this->cards,$pos); //Just a test to make sure rules are correctly followed. Could be removed to increase speed performance if ($cards[0]->is_visible()) return $cards; echo("serious problem here, trying to move a column starting with a non visible card<br>"); return array(); } // Return position of card $c if it is found in the column, -1 otherwise // "Found" means exists AND is visible function find($c) { foreach($this->cards as $pos=>$card) { if ($card->is_visible() && $card->name()==$c->name()) return $pos; } return -1; } //Will turn topmost card of the column face up //Return number of cards returned (0 or 1 actually). function faceup() { if (count($this->cards)==0) return 0; //nothing left to face up $card = array_pop($this->cards); if (!$card->is_visible()) { $card->set_visible(true); array_push($this->cards,$card); return 1; } else { array_push($this->cards,$card); return 0; } } //Return the top most card of a column function topmost() { if (count($this->cards)==0) return ''; $card = end($this->cards); //Again, just a test to make sure rules are correctly followed. Could be removed to increase speed performance if ($card->is_visible()) return $card; else return ''; } //return moveable cards in a column (that is, all the visible ones) function moveable() { if (count($this->cards)==0) return array(); //If column is empty, return no cards //Let's find out the first visible card of the column, which should be the head of the moveable cards foreach($this->cards as $pos=>$card) { //No reason to move a column headed by a king if ($pos==0 && $card->is_visible() && substr($card->name(),0,1)=='K') return array(); if ($card->is_visible()) { //We found it, let's fetch the moveable cards return array_slice($this->cards,$pos); } } //No card is visible in this column, this should never happen (if there are cards of course) !!! return array(); } //Return number of cards in this column function card_count() { return count($this->cards);} function get_card($pos) { if (count($this->cards)>$pos) return $this->cards[$pos]; else return ''; } //Draw a nice table to display our column vertically. Each card occupy a row function draw($graphic=false) { reset($this->cards); echo('<table border=1>'); if ($graphic) { $count=count($this->cards); foreach($this->cards as $card) { echo('<tr><td>'); if ($card->is_visible()) { if ($count>1) $src='c_'.$card->name().'.jpg'; else $src=$card->name().'.jpg'; echo('<img src="'.PATH_TO_IMAGES.$src.'">'); } else { echo('<img src="'.PATH_TO_IMAGES.'hidden.jpg">'); } echo('</td></tr>'); $count--; } } else { foreach($this->cards as $card) { echo('<tr><td>'); //Start row if ($card->is_visible()) { echo($card->c_name()); } else echo("X"); echo('</td></tr>'); //End row } } echo('</table>'."\n"); } } //End class column //Class responsible to manage the main tableau class tableau { var $columns = array(); //Those are the columns of the tableau var $nb_column; //Number of column in our tableau (could have been hardcoded though) //Initialize tableau by playing cards over columns function tableau(&$stock,$nb_column=7) { $this->nb_column = $nb_column; //Define number of columns in our tableau for($i=0;$i<$this->nb_column;$i++) { //Create our column $this->columns[] = new column(); } $i=0; $j=0; while ($j<$this->nb_column) { //Play cards from stock to the tableau to initialize it for($i=$j;$i<$this->nb_column;$i++) { $card = $stock->GetCard(1); //We play one card at a time $stock->UseCard(); if ($i==$j) $card->set_visible(true); //Set each last card visible $this->columns[$i]->append($card); //Append it down the column } $j++; } } //This function will return an array of cards which are the ones that are susceptible to be stacked onto fondation //ie, each latest card from each column function get_topmost() { $cards = array(); foreach($this->columns as $column) { //We simply retrieve the topmost card for each columns $cards[] = $column->topmost(); } return $cards; } //Will return an array of row of cards that are moveable from a column to another //ie, all the cards in each row that are visible function get_moveable() { $moveable=array(); foreach($this->columns as $column) { //We simply retrieve the moveable cards for each columns $moveable[] = $column->moveable(); } return $moveable; } function empty_column_count() { $count=0; foreach($this->columns as $column) if ($column->card_count()==0) $count++; return $count; } //Will check if a given card could be placed somewhere in the tableau //Will return an array containing the columns where the given card could be placed function is_placeable($card) { $valid = array(); //Let's check each column to see if card could be placed there foreach($this->columns as $id=>$column) { $topmost = $column->topmost(); //Retrieve column's topmost card if (($topmost=='') && ($card->symbol=='K')) //Only Kings can fit in an empty column $valid[]=$id; else { //Let's check if card can fit over current topmost card : column not empty && color!= && next value if ($topmost!='' && ($topmost->color()!=$card->color()) && ($topmost->val()==$card->val()+1)) { $valid[]= $id; } } } return $valid; } //Will browse the tableau to find out if given card is visible or not //This function is mainly used to see if a card is worth stacked or not function is_visible($card) { foreach($this->columns as $id=>$column) { if (($pos=$column->find($card))!=-1) return true; //Card is found in this column } //Card was not found, return false return false; } //Will check if all kings are heading a column or if there is a room (empty column) for them //Return true if Number of empty rows + number of kings heading a row >= 4 //Mainly used to check if it's worth to move a card from a column to another one function all_kings() { $kings=0; foreach($this->columns as $id=>$column) { $firstcard = $this->columns[$id]->get_card(0); //Fetching first card of a row (bottom most) if ($firstcard=='' || ($firstcard->symbol()=='K' && $firstcard->is_visible())) $kings++; //Count it if it's empty or headed by a king } return ($kings>=4); // } //Will remove a card (or a row of cards) from a given column //if column is not supplied, a search will be made through each column to locate the given card //Return the card(s) if they are found, empty array otherwise function remove($card,$column=-1) { //Column was specified if ($column != -1) { if (($pos = $this->columns[$column]->find($card)) !=-1) { //if card is found in specified column $cards = $this->columns[$column]->remove($pos); //remove it return $cards; //Return removed card } return array(); //Card was not found in specified column, return empty array } //No column supplied, so search for card foreach($this->columns as $id=>$column) { if (($pos=$column->find($card))!=-1) { //Card is found in this column $cards = $this->columns[$id]->remove($pos); //Remove it return $cards; //Return removed card } } return array(); //Card was not found in the tableau, return empty array } //Will append an array of cards over specified column function append($cards,$column) { $this->columns[$column]->append($cards); } //Turn given column's last card face up if needed //If no column is given, turn all columns last card face up if needed //Return number of cards turned function turn_faceup($column=-1) { if ($column!=-1) { return $this->columns[$column]->faceup(); } $count=0; foreach($this->columns as $id=>$column) { $count += $this->columns[$id]->faceup(); } return $count; } //Draw a nice table to display our tableau. Each column occupy a column function draw($graphic=false) { echo("<table><tr valign=top>\n"); foreach($this->columns as $column) {echo('<td>');$column->draw($graphic);echo('</td>');} echo("</tr></table>\n"); } } //End class tableau //Class responsible to manage the fondation class fondation { var $stack = array(); //Our stack of cards function fondation () { $this->stack['S']=array(); //spades $this->stack['H']=array(); //Hearts $this->stack['D']=array(); //Diamonds $this->stack['C']=array(); //Clubs } //Check if a given card is stackable or not function is_stackable($card) { if ($card->val()=='0' && count($this->stack[$card->kind()])==0) return true; else if (count($this->stack[$card->kind()])==0) return false; $last_card = end($this->stack[$card->kind()]); if ($card->val()==$last_card->val()+1) {return true;} return false; } //Check if a given card is stacked function is_stacked($card) { global $order; //split_card_name($card,$val,$kind,$color); //$pos = $order[$val]; if (isset($this->stack[$card->kind()][$card->val()])) return true; else return false; } //Take a card and stack it. NO check is done !! function stack($card) { $this->stack[$card->kind()][] = $card; } //Draw a nice output to diplay the fondation function draw($graphic) { foreach($this->stack as $id=>$cards) { if (!$graphic) echo("$id &nbsp;->&nbsp;"); foreach($cards as $card) { if ($graphic) echo('<img src="'.PATH_TO_IMAGES.$card->name.'.jpg">'); else echo($card->symbol()."&nbsp;"); } echo("<br>\n"); } } //Check if the fondation is full (then we know we won) function is_full() { foreach($this->stack as $id=>$cards) { if (count($cards)<13) return false; //if a stock holds less than 13 cards, it's not full } return true; } } //End class fondation //Draw the current situation (tableau + fondation) function draw_situation() { global $tableau, $fondation; global $graphic,$score; echo("<table border=1>"); echo("<tr><td colspan=2 align=\"center\">score : $score</td></tr>"); echo("<tr><td>"); $tableau->draw($graphic); echo("</td><td>"); $fondation->draw($graphic); echo("</td></tr></table>\n"); } //This function will decide which column is the *best* one to move a card on when there are more than one possible choice (2 actually) //Best column number will be returned function best_column($columns,$cards) { global $tableau; if (count($columns) <= 1) return $columns[0]; //no choice, just return with only available position if ($cards[0]->symbol()=='K') return $columns[0]; //No need to bother for a king //we'll never have more than 2 possible column for a card, so let's isolate them $col1=$tableau->columns[$columns[0]]; $col2=$tableau->columns[$columns[1]]; //If number of cards in col1 < 2, let's first check if col 2 isn't better, otherwise check col1 if ($col1->card_count() < 2) { //not enough cards on $col1 to decide if col1 is the best place to move the card //so, we'll check $col2 to see if current card's kind is the same as (last-1) card if ($col2->card_count() >= 2) { $match_card=$col2->get_card($col2->card_count()-2); if ($match_card->kind() == $cards[0]->kind()) return $columns[1]; else return $columns[0]; } else return $columns[0]; //both column have only 1 card, so there is no 'best' choice } else { //$col1 holds enough cards to decide if it's the 'best' choice $match_card=$col1->get_card($col1->card_count()-2); if ($match_card->kind() == $cards[0]->kind()) return $columns[0]; else return $columns[1]; } //We should never reach here, but just in case, let's return a column return $columns[0]; } function best_move($moveable_cards,$column) { global $tableau; global $random_used; $nb_empty=$tableau->empty_column_count(); $proposed_cards=$moveable_cards[$column]; $top_card=$proposed_cards[0]; for($i=$column+1;$i<count($moveable_cards);$i++) { $cards=$moveable_cards[$i]; if (count($cards)==0) continue; if (($cards[0]->val()==$top_card->val()) && ($cards[0]->color()==$top_card->color())) { //This card could be moved in place of the other one. What shall we do ? //if the proposed will free a column and we don't really need one, better move the other card if ($top_card == $tableau->columns[$column]->get_card(0) && ($nb_empty>0 || $tableau->all_kings())) return false; //otherwise, move the proposed card if it's closer to the top of the column than the other one //if($tableau->columns[$column]->find($top_card) < $tableau->columns[$i]->find($cards[0]))return false; $random_used=true; return (rand(0,10) > 5); } } return true; } //Check if a card is worth moved //The only case a card is absolutely not worth moved is when : //- There are no more hidden cards in the card's column, and //- All 4 kings are either heading a column or have a free column to be moved on, and //- The second card with the same value / same color is already visible (on tableau or stacked) or there is a place for it //If all 3 conditions matches, the card won't be moved function safe_keep($cards,$column) { global $tableau; global $reverse_order; if ($tableau->columns[$column]->find($cards[0]) != 0) return false; if ($cards[0]->color() == 'R') { if ($cards[0]->kind()=='H') $same=new card($reverse_order[$cards[0]->val()].'D'); else $same = new card($reverse_order[$cards[0]->val()].'H'); } else { if ($cards[0]->kind=='S') $same=new card($reverse_order[$cards[0]->val()].'C'); else $same = new card($reverse_order[$cards[0]->val()].'S'); } $places = $tableau->is_placeable($same); if ($tableau->is_visible($same) && count($places)>1) return false; if (!$tableau->all_kings()) return false; //Card is not worth moved if we reach here return false; } //Check if a card is safe to stack function safe_stack($card,$column) { global $fondation,$tableau; global $order; global $reverse_order; //If moving this card means freeing a column for a king, then no hesitation, stack it ! if(($column!=-1) && !$tableau->all_kings() && ($tableau->columns[$column]->get_card(0)==$card)) return true; if (($card->val()==0) || ($card->val()==1)) return true; //aces and 2 are always ok if ($card->color=='R') { $C1 = new card ($reverse_order[$card->val()-1].'C'); $C1stacked = $fondation->is_stacked($C1); $C1visible = $tableau->is_visible($C1); $S1 = new card($reverse_order[$card->val()-1].'S'); $S1stacked = $fondation->is_stacked($S1); $S1visible = $tableau->is_visible($S1); $C1present = $C1stacked || $C1visible; $S1present = $S1stacked || $S1visible; if ($C1present && $S1present) return true; $C2 = new card ($reverse_order[$card->val()-2].'C'); $C2stacked = $fondation->is_stacked($C2); $S2 = new card($reverse_order[$card->val()-2].'S'); $S2stacked = $fondation->is_stacked($S2); if ($S1present && $C2stacked) return true; if ($C1present && $S2stacked) return true; if ($C2stacked && $S2stacked) return true; } else { $H1=new card($reverse_order[$card->val()-1].'H'); $H1stacked = $fondation->is_stacked($H1); $H1visible = $tableau->is_visible($H1); $D1=new card($reverse_order[$card->val()-1].'D'); $D1stacked = $fondation->is_stacked($D1); $D1visible = $tableau->is_visible($D1); $H1present = $H1stacked || $H1visible; $D1present = $D1stacked || $D1visible; if ($H1present && $D1present) return true; $H2=new card ($reverse_order[$card->val()-2].'H'); $H2stacked = $fondation->is_stacked($H2); $D2=new card ($reverse_order[$card->val()-2].'D'); $D2stacked = $fondation->is_stacked($D2); if ($H1present && $D2stacked) return true; if ($D1present && $H2stacked) return true; if ($D2stacked && $H2stacked) return true; } return false; } //This function is part of the main algo. It's used to check (and eventually move) the moveable cards from the //tableau to the tableau. //Main goal is to uncover hidden cards and/or free cells for kings //Attempt is made to move a card to the best place if more than one possible choice is given //Whenever a card is moved, hidden card will be turned face up, score adapted and situation draw to browser function move() { global $tableau; //We need to access tableau global $score; //We'll update score $moved=false; //The function returns this $moveable_cards = $tableau->get_moveable(); //Get moveable cards from tableau //uasort($moveable_cards,'sort_cards'); //sort moveable cards by higher value first so they will be moved first //Now we will check each rows of moveable cards to find out if they are moveable somewhere else foreach($moveable_cards as $column=>$cards) { if (count($cards) == 0) continue; //No reason to move an empty column, so just skip it //Get possible new places for the given card. By rules a card can have up to maximum 2 possible positions $valid_columns = $tableau->is_placeable($cards[0]); if (count($valid_columns)==0) continue; //There is no way to move this row of card so skip to next one //Cards are moveable, let's check if it's safe to keep them nevertheless if (safe_keep($cards,$column)) continue; //Yes, so skip to next one //Let's now check if there is no a better move in this turn if (!best_move($moveable_cards,$column)) continue; //Card not moved because it's not the best move //Finally, we can try to figure out a best move for this row of cards $n_column = best_column($valid_columns,$cards); //And proceed to the actual move Message("Moving cards (".$cards[0]->c_name().") from column $column to column $n_column in tableau"); $cards = $tableau->remove($cards[0],$column); $tableau->append($cards,$n_column); $moved=true; $score+=($tableau->turn_faceup($column)*5); //Turn face up and increment score if applicable draw_situation(); //let user know what happened break; //Once a card has been moved, chance will be given to talon, so we break here } return $moved; } //This function is part of the main algo. It's used to check (and eventually stack) all stackable cards from the //Tableau to the fondation. //Main goal is to stack cards in a safe way if $always is false or to score if $always is true //Whenever a card is stacked, hidden card will be turned face up, score adapted and situation draw to browser function stack($always) { global $tableau,$fondation; //We need to access tableau and fondation global $score; //We'll update score $stacked = false; //The function returns this $cards = $tableau->get_topmost(); //Get stackable cards from tableau //Now we'll check each stackable card to find out if they are stackable or not foreach($cards as $column=>$card) { if ($card=='') continue; //No cards in this column, continue to next one if (!$fondation->is_stackable($card)) continue; //It's not possible to stack this card, so continue to next one if (!$always && !safe_stack($card,$column)) continue; //We want to play safe and it's not a safe stack, continue to next one //Finally, if all went fine, we can now proceed to stack the card $cards = $tableau->remove($card,$column); //first remove it if (count($cards)!=1) { echo("We got a serious problem here with ".count($cards)." cards<br>"); } else { Message("Moving card ".$card->c_name()." from tableau to fondation"); //Then stack it $fondation->stack($cards[0]); $score+=10; $stacked = true; $score+=($tableau->turn_faceup($column)*5); //Turn face up and increment score if applicable draw_situation(); //let user know what happened //break; } } return $stacked; } //This function is part of the main algo. It's used to check (and eventually move/stack) cards from the //talon to either the tableau or the fondation. Priority is given to tableau (to score more). //stackable cards are evaluated to be safe/unsafe and, if unsafe, will be stacked to score max if $always is true //Moveable cards are evaluated against moveable cards in tableau and priority is given to cards from tableau if it's not safe //to keep them function playfromtalon(&$card,$always,$skip_random) { global $stock,$tableau,$fondation; //We need access to stock, tableau and fondation global $score; //We'll update score $stock_used=false; //The function return this do { $played=false; $card = $stock->CurrentCard(); //Get current card from talon if ($card=='') { //If no more cards in talon, play 3 cards from stock $card = $stock->GetCard(3); if ($card!='') Message('Playing 3 cards from stock ->'.$card->c_name()); } if ($card!='') { //If we have a card to play with, go on (We may have reach the end of the stock) $valid_columns = $tableau->is_placeable($card); if (count($valid_columns)>0) { //Check if card is placeable to tableau //Let's check if the card we want to play from talon is not available from the tableau $moveable_cards=$tableau->get_moveable(); foreach($moveable_cards as $column=>$moveable_card) { //If it's the case, *maybe* we are better to play card from tableau if (count($moveable_card)==0) continue; //No card to move in this column if (($card->val() == $moveable_card[0]->val()) && ($card->color()==$moveable_card[0]->color())) { if (!safe_keep($moveable_card,$column)) break 2; } } if ($skip_random && $stock_used) { //We will randomly skip this card if we played at least one before if ($card->symbol() != 'K' && $card->symbol()!='1') { //We won't skip a king or an ace !! if (rand(0,10)>6) { $stock->GetCard(3); break; } } } $n_column = best_column($valid_columns,array($card)); $stock->UseCard(); //Yes, take card from stock $card->set_visible(true); $tableau->append(array($card),$n_column); //And move it into tableau $score+=5; $stock_used=true; Message("moving card ".$card->c_name()." from stock to tableau, column ".$n_column); $played=true; } else if ($fondation->is_stackable($card)) { //Check if card from stock is stackable if (!$always && !safe_stack($card,-1)) break; //Not a safe stack -> don't stack $stock->UseCard(); //Yes, take card from stock $card->set_visible(true); $fondation->stack($card); //And stack it on fondation $score+=10; $stock_used=true; $played=true; Message("moving card ".$card->c_name()." from stock to fondation"); } else $played=false; if ($played) draw_situation(); } } while ($played && $card!=''); return $stock_used; } function sort_cards($a,$b) { global $order; if (count($a)==0 || count($b)==0) return (count($a)==0); if ($a[0]->val()==$b[0]->val()) return 0; return ($a[0]->val() > $b[0]->val()) ? -1 : 1; } $try = 0; //current tries counter $random_used=false; //Will be set if random moves have been used in any try $time_start = getmicrotime(); //Everything is set up, now we can start the timer do { //main loop for tries ob_start(); //Each try will be stored in its own output_buffer $stock = new stock($stockfilename); Message("Initializing Tableau"); $tableau = new tableau($stock); $fondation = new fondation(); $score=0; //score is 0 $loop=0; //we can use up to 3 passes through the stock $stock_used=false; // draw_situation(); do { //Do a pass through the stock do { //Keep playing to stack and to tableau till no move are available without a new card from stock playfromtalon($card,$loop>=1,$try>2); //Let's check if any cards is stackable on the fondation do { $stacked = stack($loop>=($try%3)); //$stacked = stack(true); if ($stacked) playfromtalon($card,$loop>=1,$try>2); } while ($stacked && ($loop<$try%3)); //Let's also check if any cards are moveable in the tableau $moved = move(); if ($moved) playfromtalon($card,$loop>=1,$try>2); } while ($stacked || $moved); //loop until nothing is moveable nor stackable do { //Play a new card from stock $card = $stock->GetCard(3); if ($card!='') Message("Playing 3 cards from stock ".$card->c_name()); if ($card!='') $stock_used=playfromtalon($card,$loop>=1,$try>2); } while (!$stock_used && $card!=''); //And loop till at least one card has been used (or stock is over) if ($card=='') { //Stock is over : $loop++; //Let's start a new pass through the stock $remains = $stock->DrawOver(); if ($loop<3) Message("<font color=\"green\">drawing stock over ($remains card remain) / pass n ".($loop+1)."</font>"); } } while($loop<3); //No more than 3 passes allowed //Stock is over or maximum passes is reached, let's move and stack until we can't do anything. do { //Let's check if any cards is stackable on the fondation $stacked = stack(true); //Let's also check if any cards are moveable in the tableau $moved = move(); } while ($stacked || $moved); //Game Over Message("<font color=\"red\" size=+1>Game Over ! Score = $score in ".$stock->turn." turns</font>"); //Store this try's score $scores[$try]=$score; //And store the output_buffer $display[$try] = ob_get_contents(); ob_end_clean(); //Start with a fresh output_buffer //Uncomment next line if you want to know the score for each tries //echo("$try : $score, "); if ($random_used) echo("<b>Random Used</b>"); echo("<br>"); //Now check if it's worth running more tries (ie, is the fondation full) if ($fondation->is_full()) break; $try++; } while ($try<6 || ($random_used && ($try<12))); //If random move went to work, let's make a few more tries (2 times more) //all tries processed, time to stop the timer $time_end = getmicrotime(); $time = $time_end - $time_start; //Let's find out which tries gave the best score $maxscore =0; foreach($scores as $try=>$score) if ($score>$maxscore) {$maxscore=$score;$bestry = $try;} //And display that try echo($display[$bestry]); echo("<br><b>".$time." second</b>"); ?>
This is a simple memory game, it has plugable html cards. I have it set at letters right now, but its easy to switch over to images. It makes heavy use of php4 sessions, and uses no javascript/etc. <? //Memory Game //Copyright 2000, Derek Young //I assume no responsibility for damages, have fun with this //code, do whatever you wish. You can replace the $hidden and //$card variable to equal whatever you want, hopefully images ;> session_register("board"); session_register("state"); if($reset) { unset($board); unset($state); } //Init State if(!$state) $state=0; //Init Hidden Card $hidden="<FONT SIZE=\"5\">X</FON