When I do that correction, it then tell me that Error The type 'TictacGame.Form1' already contains a definition for 'Startbutton' and the same for all the buttons shown in the code in my previous message. Why is that?

sorted.Thanks.

modified on Saturday, October 18, 2008 5:21 AM

Yes. I removed it earlier on.

Tried to.Still not fixed. When I put a descriptive name, it tell me that namespace with that descriptive name already contains a definition for that name .

How do I fix this error which says "The namespace 'Game' already contains a definition for 'Form1'" What does it mean and how do I fix it. It resulted after I wrote this; public class Form1: System.Windows.Forms.Form Thanks.

This is a pseudocode for Monte Carlo rabin_karp algorithm. Input Parameters: p,t Output Parameters: None; Mc_rabin_karp_search(p,t) { m = p.length n = t.length q = randomly chosen prime number less than mn2 r = 2 ^(m-1) mod q //computation of initial remainders f[0]=0 pfinger = 0 for j = 0 to m-1 { f[0] = 2*f[0]+t[j] mod q pfinger = 2*pfinger + p[j]mod q } i = 0; while(i + m<=n) { if ( f[i] = = pfinger) println (“Match at position”+i) f[i + 1] = 2*(f[i] – r*t[i]) + t[i+m]mod q i = i +1 } } What am seeking is a sample of a working code to help me understand it actual implementation. Thanks

Thanks, but am after a working example not just a pseudocode.

Where can I find sample codes showing implementation of Monte Carlo rabin_karp search NOT just a pseudocode. Thanks

Where can I find sample codes showing implementation of Monte Carlo rabin_karp search. Thanks

My question after all is about how to add a code with the variable that holds minimax value of the node, the node having a variable that holds the board position bearing in mind that the value of this valuable can be an array of length 9 which makes values X and O (or 1 and -1 talking of integers) leading to generating a tree automatically by computing successor states for the board positions represented by a particular code, starting with the empty board for the root node, recursively computing successors until terminal nodes reached.

using System; using System.Collections.Generic; using System.Text; public class Minimax { static void Main(string[] args) { // generate a simple game tree, starting with the root Tree tree = new Tree(0); // children of the root tree.children = new Forest(new int[] { 0, 0 }); // children of the left child of the root tree.children.first.children = new Forest(new int[] { 0, 7, 9 }); // children of the right child of the root tree.children.rest.first.children = new Forest(new int[] { 4, 8, 6 }); // children of the leftmost child of the left child of the root tree.children.first.children.first.children = new Forest(new int[] { 5, 3, 1 }); // write the expected and calculated minimax values to the console Console.WriteLine("Expected minimax value is 5"); Console.WriteLine("Calculated minimax value of the tree " + tree.Minimax(true)); //Console.Write(tree.children.first); Console.WriteLine("Press any key to exit ..."); Console.ReadKey();

using System; using System.Collections.Generic; using System.Text; public class Minimax { static void Main(string[] args) { // generate a simple game tree, starting with the root Tree tree = new Tree(0); // children of the root tree.children = new Forest(new int[] { 0, 0 }); // children of the left child of the root tree.children.first.children = new Forest(new int[] { 0, 7, 9 }); // children of the right child of the root tree.children.rest.first.children = new Forest(new int[] { 4, 8, 6 }); // children of the leftmost child of the left child of the root tree.children.first.children.first.children = new Forest(new int[] { 5, 3, 1 }); // write the expected and calculated minimax values to the console Console.WriteLine("Expected minimax value is 5"); Console.WriteLine("Calculated minimax value of the tree " + tree.Minimax(true)); //Console.Write(tree.children.first); Console.WriteLine("Press any key to exit ..."); Console.ReadKey();

Thanks all for your guidance. I am trying to have it all programmed in c#.

I believe it has to do with double power(val, n) etc.

I just wonder if there is a way of raising a number to a certain power by c# code i.e coding such a function in c#. e.g 3^5,OR 3^x where x can be a variable, now writing this in code form????

Would this operate as a recursive function? If not, how best can one implement the summation recursively.

Just how does a loop get applied in this case.

Is it possible to get an approximate sum of S defined as 1/2 + 1/4 + 1/8 to a certain number of counts? Say up to 1/16? If so how does one write such a code in c# to achieve this? Thanks

Its all about implementing a recursive function.

How do I write a console application that imoplements a recursive function that calculates the approximate infinite sum(of time) of zeno's paradox depending on the number of attempts of Archelles to overtake the tortoise. Thanks