Archive for February, 2011

February 22, 2011

Fun fair at the town of Svishtov


February 17, 2011

Perfect angular ‘Surface’ simultion – 12 XII


4*PI*R^2=S
4*PI*25=144
PIdx=1,44
dx=1,44/180=0,008 degree surface units(DSU)
DSU= see thickness of ‘surface’ per Degree in 3D Graphics !

February 16, 2011

Binary tree. C++ Programming code


class node

{

public:
char data;
class node* left;
class node* right;
};

node* build1plus2a()

{
node* root = newNode(+);
node* lChild = newNode(1);
node* rChild = newNode(2);

root->left = lChild;
root->right= rChild;

return root;
}

node* build1plus2b()

{
node* root = newNode(+);
root->left = newNode(1);
root->right = newNode(2);

return root;

}

int size2( node* node)

{
if (node==NULL)

{
return 0;
}

else

{
return(size(node->left) + 1 + size(node->right));
}
}

int maxDepth( node* node)

{
if (node==NULL)

{
return 0;
}
else

{
int lDepth = maxDepth(node->left);
int rDepth = maxDepth(node->right);

if (lDepth > rDepth) return(lDepth+1);
else return(rDepth+1);
}
}

void printExpressionTreePostfix ( node* node)

{
if (node == NULL) return;

printExpressionTreePostfix (node->left);
printExpressionTreePostfix (node->right);

cout<<node->data;
}

void printExpressionTreeInfix(node* node)

{

if (node == NULL) return;

printExpressionTreeInfix(node->left);

cout<<node->data;

printExpressionTreeInfix(node->right);

}

void printExpressionTreePrefix(node* node)

{

if (node == NULL) return;

cout<<node->data;

printExpressionTreePrefix(node->left);

printExpressionTreePrefix(node->right);

}

void mirror( node* node)

{
if (node==NULL)

{
return;
}
else

{
node* temp;

mirror(node->left);
mirror(node->right);

temp = node->left;
node->left = node->right;
node->right = temp;
}
}

void doubleTree( node* node)
… you write that !

February 15, 2011

Pig’s funeral 18+


February 14, 2011

Once upon a time in Riga…


February 7, 2011

King’s Gambit with Counter-gambit at d5


1. e4 e5
2. f4 d5
3. exd5 e4
4. d3 Nf6
5. dxe4 Nxe4
6. Nf3 Nf6
7. Nc3 Bb4
8. Qe2+ Qe7
9. Qxe7+ Kxe7
 
10. Bd2 Re8
11. O-O-O Kf8
12. Nb5 Bxd2+
13. Rxd2 Na6 


14.d6 c6
15. Nc3 Nb4
16. a3 Nbd5
17. Nxd5 cxd5
18. Ne5 a6
19. c4


Be6
20. c5 Rac8
21. Rc2 Ne4
22. b4 f6
23. Nf3 Bd7
24. Kb2 Ba4
25. Rc1

 Nf2
26. Rg1 Re3
27. Nd4 Rce8
28. c6 bxc6
29. Nxc6 Rb3+
30. Ka2 Ree3


31. d7 Rxa3+ 32. Kb2 Reb3+ 33. Kc2
Ra2# 


0-1
February 7, 2011

One lost and one curious Chess games


The lost one

 

 

The curious one:

 

February 3, 2011

Science horror !


 

 

February 3, 2011

Puzzle 1


I achieved that position in a real game !

 

White to move !

February 3, 2011

Unfinished correspondence game


1.d4—Nf6
2.c4—g6
3.Nf3—Bg7
4.Nc3—d5
5.e3—0-0
6.Bd3—c5
7.dXc—dXc
8.BXc4—QXd1
9.KXd1—Nc6
10.Ke2—Of5
11.Nd4—Nd7
12.NXf5—gXf
13.Na4—Rac8
14.f4—Nf6